Projections for fast protein structure retrieval
Open Access
- 18 December 2006
- journal article
- research article
- Published by Springer Nature in BMC Bioinformatics
- Vol. 7 (S5) , S5
- https://doi.org/10.1186/1471-2105-7-s5-s5
Abstract
In recent times, there has been an exponential rise in the number of protein structures in databases e.g. PDB. So, design of fast algorithms capable of querying such databases is becoming an increasingly important research issue. This paper reports an algorithm, motivated from spectral graph matching techniques, for retrieving protein structures similar to a query structure from a large protein structure database. Each protein structure is specified by the 3D coordinates of residues of the protein. The algorithm is based on a novel characterization of the residues, called projections, leading to a similarity measure between the residues of the two proteins. This measure is exploited to efficiently compute the optimal equivalences.Keywords
This publication has 26 references indexed in Scilit:
- Identification of common molecular subsequencesPublished by Elsevier ,2004
- 1001 Optimal PDB Structure Alignments: Integer Programming Methods for Finding the Maximum Contact Map OverlapJournal of Computational Biology, 2004
- Evaluation of protein fold comparison serversProteins-Structure Function and Bioinformatics, 2003
- Circularly permuted proteins in the protein structure databaseProtein Science, 2001
- Structure Comparison and Structure PatternsJournal of Computational Biology, 2000
- The Protein Data BankNucleic Acids Research, 2000
- Protein Structure Comparison by Alignment of Distance MatricesJournal of Molecular Biology, 1993
- Protein structure alignmentJournal of Molecular Biology, 1989
- An eigendecomposition approach to weighted graph matching problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Closed-form solution of absolute orientation using unit quaternionsJournal of the Optical Society of America A, 1987