To annotate the biological function of a protein molecule, it is essential to have information on its 3D structure. Many successful methods for function prediction are based on determining structurally conserved regions because the functional residues are proved to be more conservative than others in protein evolution. Since the 3D conformation of a protein can be represented by a contact map graph, graph matching, algorithms are often employed to identify the conserved residues in weakly homologous protein pairs. However, the general graph matching algorithm is computationally expensive because graph similarity searching is essentially a NP-hard problem. Parallel implementations of the graph matching are often exploited to speed up the process. In this chapter,the authors review theoretical and computational approaches of graph theory and the recently developed graph matching algorithms for protein function prediction.
Protein Homology Analysis for Function Prediction with Parallel Sub-Graph Isomorphism
Alper Kucukural,A. Szilágyi,O. U. Sezerman,Yang Zhang
Published 2011 in Unknown venue
ABSTRACT
PUBLICATION RECORD
- Publication year
2011
- Venue
Unknown venue
- Publication date
Unknown publication date
- Fields of study
Biology, Mathematics, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-65 of 65 references · Page 1 of 1
CITED BY
Showing 1-9 of 9 citing papers · Page 1 of 1