A Branch and Bound Algorithm for Matching Protein Structures

  • Janez Konc
  • Dušanka Janežič
Conference paper

DOI: 10.1007/978-3-540-71629-7_45

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4432)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Janez Konc
    • 1
  • Dušanka Janežič
    • 1
  1. 1.National Institute of Chemistry, Hajdrihova 19, SI-1000 LjubljanaSlovenia

Personalised recommendations