Issue No. 05 - September/October (2011 vol. 8)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TCBB.2011.35
Marco Mernberger , Philipps University, Marburg
Gerhard Klebe , Philipps University, Marburg
Eyke Hüllermeier , Philipps University, Marburg
Comparative analysis is a topic of utmost importance in structural bioinformatics. Recently, a structural counterpart to sequence alignment, called multiple graph alignment, was introduced as a tool for the comparison of protein structures in general and protein binding sites in particular. Using approximate graph matching techniques, this method enables the identification of approximately conserved patterns in functionally related structures. In this paper, we introduce a new method for computing graph alignments motivated by two problems of the original approach, a conceptual and a computational one. First, the existing approach is of limited usefulness for structures that only share common substructures. Second, the goal to find a globally optimal alignment leads to an optimization problem that is computationally intractable. To overcome these disadvantages, we propose a semiglobal approach to graph alignment in analogy to semiglobal sequence alignment that combines the advantages of local and global graph matching.
Approximate graph matching, protein binding sites, structure comparison, graph alignment, structural bioinformatics.
G. Klebe, E. Hüllermeier and M. Mernberger, "SEGA: Semiglobal Graph Alignment for Structure-Based Protein Comparison," in IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 8, no. , pp. 1330-1343, 2011.