Akademik Veri Yönetim Sistemi
BIOINFORMATICS: CONCEPTS, METHODOLOGIES, TOOLS, AND APPLICATIONS, ss.386-399, 2013 (SCI-Expanded)
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.