A fast unbiased comparison of protein structures by means of the Needleman-Wunsch algorithm
- Cite this article as:
- Rose, J. & Eisenmenger, F. J Mol Evol (1991) 32: 340. doi:10.1007/BF02102193
- 67 Downloads
A fast dynamic programming algorithm for the spatial superposition of protein structure without prior knowledge of an initial alignment has been developed. The program was applied to serine proteases, hemoglobins, cytochromes C, small copper-binding proteins, and lysozymes. In most cases the existing structural homology could be detected in a completely unbiased way. The results of the method presented are in general agreement with other studies. Applying our method, the different alignment results obtained by other authors for serine proteases and cytochromes C can be classified in terms of different alignment parameters such as gap penalties or cut-off length. Limitations of the method are discussed.