Conformational Transitions and Principal Geodesic Analysis on the Positive Semidefinite Matrix Manifold
Given an initial and final protein conformation, generating the intermediate conformations provides important insight into the protein’s dynamics. We represent a protein conformation by its Gram matrix, which is a point on the rank 3 positive semidefinite matrix manifold, and show matrices along the geodesic linking an initial and final Gram matrix can be used to generate a feasible pathway for the protein’s structural change. This geodesic is based on a particular quotient geometry. If a protein is known to contain domains or groups of atoms that act as rigid clusters, facial reduction can be used to decrease the size of the Gram matrices before calculating the geodesic. The geodesic between two conformations is only one path a protein’s Gram matrix can follow; principal geodesic analysis (PGA) is one possible strategy to find other geodesics.
Keywordscliques rigid clusters elastic network interpolation Euclidean distance matrix Gram matrix positive semidefinite facial reduction geodesic Riemannian manifold principal geodesic analysis
Unable to display preview. Download preview PDF.
- 3.Alipanahi, B.: New Approaches to Protein NMR Automation. Ph.D. thesis, University of Waterloo (2011)Google Scholar
- 7.Burkowski, F.J.: Structural Bioinformatics: An Algorithmic Approach. Chapman & Hall/CRC (2009)Google Scholar
- 12.Goh, A.: Riemannian manifold clustering and dimensionality reduction for vision-based analysis. In: Machine Learning for Vision-Based Motion Analysis, pp. 27–53. Springer (2011)Google Scholar
- 13.Goh, A., Vidal, R.: Clustering and dimensionality reduction on Riemannian manifolds. In: IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2008, pp. 1–7. IEEE (2008)Google Scholar
- 16.Kim, M.K.: Elastic Network Models of Biomolecular Structure and Dynamics. Ph.D. thesis, The Johns Hopkins University (2004)Google Scholar
- 20.Krislock, N.: Semidefinite facial reduction for Low-Rank Euclidean Distance Matrix Completion. Ph.D. thesis, School of Computer Science, University of Waterloo (2010)Google Scholar
- 22.Meyer, G.: Geometric optimization algorithms for linear regression on fixed-rank matrices. Ph.D. thesis, University of Liège (2011)Google Scholar
- 23.Mishra, B., Meyer, G., Sepulchre, R.: Low-rank optimization for distance matrix completion. In: 2011 50th IEEE Conference on Decision and Control and European Control Conference (CDC-ECC), Orlando, FL, USA, December 12-15, pp. 4455–4460 (2011)Google Scholar
- 24.Mishra, B., Meyer, G., Bach, F., Sepulchre, R.: Low-rank optimization with trace norm penalty. arXiv preprint arXiv:1112.2318 (2011)Google Scholar
- 28.Vandereycken, B.: Riemannian and multilevel optimization for rank-constrained matrix problems. Ph.D. thesis, Department of Computer Science, KU Leuven (2010)Google Scholar