Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Schmitt, S., Kuhn, D., Klebe, G.: A new method to detect related function among proteins independent of sequence and fold homology. Journal of Molecular Biology 323, 387–406 (2002)
Bron, C., Kerbosch, J.: Algorithm 457 - Finding all cliques of an undirected graph. Commun. ACM 16, 575–577 (1973)
Tomita, E., Seki, T.: An efficient branch-and-bound algorithm for finding a maximum clique. In: Calude, C.S., Dinneen, M.J., Vajnovszki, V. (eds.) DMTCS 2003. LNCS, vol. 2731, pp. 278–289. Springer, Heidelberg (2003)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
Östergård, P.R.J.: A fast algorithm for the maximum clique problem. Discrete Applied Mathematics 120, 197–207 (2002)
Pennec, X., Ayache, N.: A geometric algorithm to find small but highly similar 3D substructures in proteins. Bioinformatics 14, 516–522 (1998)
Raymond, J.W., Willett, P.: Maximum common subgraph isomorphism algorithms for the matching of chemical structures. Journal of Computer-Aided Molecular Design 16, 521–533 (2002)
Konc, J., Janežič, D.: A maximum clique problem revisited. European Journal of Operations Research (to appear)
Kabsch, W.: A discussion of the solution for the best rotation to relate two sets of vectors. Acta Cryst. A34, 827–828 (1978)
Konc, J., Hodošček, M., Janežič, D.: Molecular surface walk. Croat. Chem. Acta 79, 237–241 (2006)
Kristan, K., Krajnc, K., Konc, J., Stanislav, G., Stojan, J.: Phytoestrogens as inibitors of fungal 17β-hydroxysteroid dehydrogenase. Steroids 70, 626–635 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Konc, J., Janežič, D. (2007). A Branch and Bound Algorithm for Matching Protein Structures. In: Beliczynski, B., Dzielinski, A., Iwanowski, M., Ribeiro, B. (eds) Adaptive and Natural Computing Algorithms. ICANNGA 2007. Lecture Notes in Computer Science, vol 4432. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71629-7_45
Download citation
DOI: https://doi.org/10.1007/978-3-540-71629-7_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71590-0
Online ISBN: 978-3-540-71629-7
eBook Packages: Computer ScienceComputer Science (R0)