Metric Similarity and Manifold Learning of Circular Dichroism Spectra of Proteins
We present a machine learning analysis of circular dichroism spectra of globular proteins from the SP175 database, using the optimal transport-based $1$-Wasserstein distance $\mathcal{W}_1$ (with order $p=1$) and the manifold learning algorithm $t$-SNE. Our results demonstrate that $\mathcal{W}_1$ is consistent with both Euclidean and Manhattan metrics while exhibiting robustness to noise. On the other hand, $t$-SNE uncovers meaningful structure in the high-dimensional data. The clustering in the $t$-SNE embedding is primarily determined by proteins with distinct secondary structure compositions: one cluster predominantly contains $\beta$-rich proteins, while the other consists mainly of proteins with mixed $\alpha/\beta$ and $\alpha$-helical content.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
The minimal model of light harvesting complex with dipole-quadrupole interaction derived from ab initio calculation
A minimal, one-parameter model of the excitonic Hamiltonian for the light harvesting complex of purple bacteria (LH2) based on ab initio calculation of the excitonic energies is proposed. The set of input parameters cont…
Imaging linear and circular polarization features in leaves with complete Mueller matrix polarimetry
Spectropolarimetry of intact plant leaves allows to probe the molecular architecture of vegetation photosynthesis in a non-invasive and non-destructive way and, as such, can offer a wealth of physiological information. I…
Duplex formation and secondary structure of {\gamma}-PNA observed by NMR and CD
Peptide Nucleic Acids (PNA) are non-natural oligonucleotides mimics. {\gamma}-PNA backbone are formed by standard nucleic acids nucleobases connected by a neutral N-(2-aminoethyl)glycine backbone linked by a peptide bond…
On Nonrigid Shape Similarity and Correspondence
An important operation in geometry processing is finding the correspondences between pairs of shapes. The Gromov-Hausdorff distance, a measure of dissimilarity between metric spaces, has been found to be highly useful fo…
Spectral Ergodicity in Deep Learning Architectures via Surrogate Random Matrices
In this work a novel method to quantify spectral ergodicity for random matrices is presented. The new methodology combines approaches rooted in the metrics of Thirumalai-Mountain (TM) and Kullbach-Leibler (KL) divergence…
Deep Learning