Protein structure comparisons using a combination of a genetic algorithm, dynamic programming and least-squares minimization.
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.
May
A C
AC
Department of Crystallography, Birkbeck College, University of London, UK.
Johnson
M S
MS
D000465:Algorithms; D000595:Amino Acid Sequence; D016208:Databases, Factual; D016018:Least-Squares Analysis; D008432:Mathematical Computing; D008958:Models, Molecular; D008969:Molecular Sequence Data; D009690:Nucleic Acid Conformation; D017434:Protein Structure, Tertiary; D012360:RNA, Transfer, Phe / Q000737:chemistry; D016415:Sequence Alignment / Q000379:methods*; D017386:Sequence Homology, Amino Acid; D012697:Serine Endopeptidases / Q000737:chemistry; D012984:Software
D012360:RNA, Transfer, Phe; D012697:Serine Endopeptidases