Protein structure comparison using bipartite graph matching and its application to protein structure classification.
A measure of protein structure similarity is calculated from the matching of pairs of secondary structure elements between two proteins. The interaction of each pair was estimated from their axial line segments and combined with other geometric features to produce an optimal discrimination between intrafamily and interfamily relationships. The matching used a fast bipartite graph-matching algorithm that avoids the computational complexity of searching for the full subgraph isomorphism between the two sets of interactions. The main algorithm used was the "stable marriage" algorithm, which works on the ranked "preferences" of one interaction for another. The method takes 1/10 of a second for a typical comparison making it suitable as a fast pre-filter for slower, more exhaustive approaches. An application to protein structure classification is described.
Taylor
William R
WR
Division of Mathematical Biology, National Institute for Medical Research, The Ridgeway, Mill Hill, London NW7 1AA, United Kingdom. wtaylor@nimr.mrc.ac.uk
D000465:Algorithms; D019295:Computational Biology / Q000379:methods*; D019992:Databases as Topic; D011487:Protein Conformation; D017433:Protein Structure, Secondary; D011506:Proteins / Q000737:chemistry* / Q000145:classification; D012984:Software
D011506:Proteins