Graph theoretic methods for the analysis of structural relationships in biological macromolecules

✍ Scribed by Peter J. Artymiuk; Ruth V. Spriggs; Peter Willett

• Publisher: John Wiley and Sons
• Year: 2005
• Tongue: English
• Weight: 241 KB
• Volume: 56
• Category: Article
• ISSN: 1532-2882
• DOI: 10.1002/asi.20140

✦ Synopsis

Abstract

Subgraph isomorphism and maximum common subgraph isomorphism algorithms from graph theory provide an effective and an efficient way of identifying structural relationships between biological macromolecules. They thus provide a natural complement to the pattern matching algorithms that are used in bioinformatics to identify sequence relationships. Examples are provided of the use of graph theory to analyze proteins for which three‐dimensional crystallographic or NMR structures are available, focusing on the use of the Bron‐Kerbosch clique detection algorithm to identify common folding motifs and of the Ullmann subgraph isomorphism algorithm to identify patterns of amino acid residues. Our methods are also applicable to other types of biological macromolecule, such as carbohydrate and nucleic acid structures.