A Branch and Bound Algorithm for Matching Protein Structures
An efficient branch and bound algorithm for matching protein structures has been developed. The compared protein structures are represented as graphs and a product graph of these graphs is calculated. The resulting product graph is then the input to our algorithm. A maximum clique in the product graph corresponds to the maximum common substructure in the original graphs. Our algorithm, which gives an approximate solution to the maximum clique problem, is compared with exact algorithms commonly used in bioinformatics for protein structural comparisons. The computational results indicate that the new algorithm permits an efficient protein similarity calculation used for protein structure analysis and protein classification.
KeywordsMaximum Clique Product Graph Maximum Clique Problem Large Clique Protein Structural Comparison
Unable to display preview. Download preview PDF.
- 8.Konc, J., Janežič, D.: A maximum clique problem revisited. European Journal of Operations Research (to appear)Google Scholar
- 9.Kabsch, W.: A discussion of the solution for the best rotation to relate two sets of vectors. Acta Cryst. A34, 827–828 (1978)Google Scholar
- 10.Konc, J., Hodošček, M., Janežič, D.: Molecular surface walk. Croat. Chem. Acta 79, 237–241 (2006)Google Scholar