PROTEIN-STRUCTURE COMPARISONS USING A COMBINATION OF A GENETIC ALGORITHM, DYNAMIC-PROGRAMMING AND LEAST-SQUARES MINIMIZATION

被引:52
作者
MAY, ACW
JOHNSON, MS
机构
[1] The Imperial Cancer Research Fund Unit of Structural Molecular Biology, Department of Crystallography, Birkbeck College, University of London, London WC1E 7HX, Malet Street
来源
PROTEIN ENGINEERING | 1994年 / 7卷 / 04期
关键词
DYNAMIC PROGRAMMING; GENETIC ALGORITHM; LEAST-SQUARES; STRUCTURE COMPARISONS; TOPOLOGICAL EQUIVALENCE;
D O I
10.1093/protein/7.4.475
中图分类号
Q5 [生物化学]; Q7 [分子生物学];
学科分类号
071010 ; 081704 ;
摘要
We introduce a completely automatic and objective procedure for the comparison of protein structures. A genetic algorithm is used to search for a near optimal solution of the rigid-body superposition of two whole protein structures. The specification of an initial set of equivalences is not required. Topological equivalences in the final structural alignment are defined by a conventional dynamic programming routine, which is commonly used to compare protein sequences. A least-squares fitting algorithm is then used to optimize the fit between the final set of equivalences. We have applied our method to the comparison of ribonucleic acid structures, as well as protein structures. The structural alignments are generally consistent with those previously published. In fact, on most occasions our method defines at least the same number of topological equivalences as other procedures, but always with a lower r.m.s. distance between them.
引用
收藏
页码:475 / 485
页数:11
相关论文
共 74 条