On updating torsion angles of molecular conformations

被引:11
作者
Choi, V [1 ]
机构
[1] Virginia Tech, Dept Comp Sci, Blacksburg, VA 24061 USA
关键词
D O I
10.1021/ci050253h
中图分类号
R914 [药物化学];
学科分类号
100701 ;
摘要
A conformation of a molecule is defined by the relative positions of atoms and by the chirality of asymmetric atoms in the molecule. The three main representations for conformations of molecules are Cartesian coordinates, a distance geometry descriptor (which consists of a distance matrix and the signs of the volumes of quadruples of atoms), and internal coordinates. In biochemistry, conformational changes of a molecule are usually described in terms of internal coordinates. However, for many applications, such as molecular docking, the Cartesian coordinates of atoms are needed for computation. Although, for each conformational change, the Cartesian coordinates of atoms can be updated in linear time (which is optimal asymptotically), the constant factor becomes significant if a large number of updates are needed. Zhang and Kavraki (J. Chem. Inf. Comput. Sci. 2002, 42, 64-70) examined three methods: the simple rotations, the DenavitHartenberg local frames, and the atom-group local frames. On the basis of their implementations, they showed that the atom-group local frames are more efficient than the other two. In this paper, by expressing the torsion-angle change as a composition of translations and rotations, we observe that the simple rotations can be implemented in an efficient way by taking advantage of consecutive operations. Both quantitative and experimental comparisons show that the improved simple rotations, in which rotations are expressed in unit quaternions, are as efficient as the atom-group local frames and, thus, have the advantage of avoiding the need of precomputations of a set of local frames and transformations between them.
引用
收藏
页码:438 / 444
页数:7
相关论文
共 16 条
[1]   On the rotational operators in protein structure simulations [J].
Alvarado, C ;
Kazerounian, K .
PROTEIN ENGINEERING, 2003, 16 (10) :717-720
[2]  
[Anonymous], 1989, INTRO ROBOTICS
[3]   YUCCA: An efficient algorithm for small-molecule docking [J].
Choi, V .
CHEMISTRY & BIODIVERSITY, 2005, 2 (11) :1517-1524
[4]  
Crippen G. M., 1988, DISTANCE GEOMETRY MO
[5]   A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances [J].
Dong, QF ;
Wu, ZJ .
JOURNAL OF GLOBAL OPTIMIZATION, 2002, 22 (1-4) :365-375
[6]  
Flower DR, 1999, J MOL GRAPH MODEL, V17, P238
[7]  
Foley J. D., 1990, Computer Graphics, Principles and Practice, V2nd
[8]  
Gasteiger J., 2003, CHEMOINFORMATICS
[9]  
HAVEL TF, 1998, ENCY COMPUTATIONAL C, P723
[10]   CLOSED-FORM SOLUTION OF ABSOLUTE ORIENTATION USING UNIT QUATERNIONS [J].
HORN, BKP .
JOURNAL OF THE OPTICAL SOCIETY OF AMERICA A-OPTICS IMAGE SCIENCE AND VISION, 1987, 4 (04) :629-642