Protein structure comparison using iterated double dynamic programming
William Ramsay Taylor · Protein Science · 1999
A protein structure comparison method is described that allows the generation of large populations of high-scoring alternate alignments. This was achieved by incorporating a random element into an iterative double dynamic programming algorithm. The maximum scores from repeated comparisons of a pair of structures converged on a value that was taken as the global maximum. This lay 15% over the score obtained from the single fixed (unrandomized) calculation. The effect of the gap penalty was observed through the shift of the alignment populations, characterized by their alignment length and root-mean-square deviation (RMSD). The best (lowest RMSD) values found in these populations provided a base-line against which other methods were compared.
Cited by 138 works. doi:10.1110/ps.8.3.654 Open-access PDF
Authors
References
- A general method applicable to the search for similarities in the amino acid sequence of two proteins
- Protein Structure Comparison by Alignment of Distance Matrices
- Atlas of Protein Sequence and Structure 1969
- CATH – a hierarchic classification of protein domain structures
- A flexible method to align large numbers of biological sequences
- A new approach to protein fold recognition
- Protein structure alignment
- Definition of general topological equivalence in protein structures
- [36] SSAP: Sequential structure alignment program for protein structure comparison
- A rapid method of protein structure alignment