## Abstract Finding the rotational matrix that minimizes the sum of squared deviations between two vectors is an important problem in bioinformatics and crystallography. Traditional algorithms involve the inversion or decomposition of a 3 × 3 or 4 × 4 matrix, which can be computationally expensive
✦ LIBER ✦
Comment on “Fast determination of the optimal rotational matrix for macromolecular superpositions” [J. Comp. Chem. 31, 1561 (2010)]
✍ Scribed by Gerald R. Kneller
- Publisher
- John Wiley and Sons
- Year
- 2010
- Tongue
- English
- Weight
- 54 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0192-8651
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
Recently Liu et al. published a fast algorithm to solve the eigenvector problem arising in the quaternion‐based method for the rotational superposition of molecular structures (J Comput Chem 2010, 31, 1561.). In this Comment, it is shown that the construction of the 4 × 4 matrix to be diagonalized—and not the diagonalization itself—represents the dominating part of the computational effort for the quaternion‐based solution of the rotational superposition problem if molecules with more than about 100 atoms are considered. © 2010 Wiley Periodicals, Inc. J Comput Chem, 2010
📜 SIMILAR VOLUMES
Fast determination of the optimal rotati
✍
Pu Liu; Dimitris K. Agrafiotis; Douglas L. Theobald
📂
Article
📅
2009
🏛
John Wiley and Sons
🌐
English
⚖ 65 KB
Rapid communication reply to comment on:
✍
Pu Liu; Dimitris K. Agrafiotis; Douglas L. Theobald
📂
Article
📅
2010
🏛
John Wiley and Sons
🌐
English
⚖ 68 KB