Protein homology analysis for function prediction with parallel sub-graph isomorphism

Warning The system is temporarily closed to updates for reporting purpose.

Küçükural, Alper and Szilagyi, Andras and Sezerman, Uğur and Zhang, Yang (2011) Protein homology analysis for function prediction with parallel sub-graph isomorphism. In: Lodhi, Huma and Yamanashi, Yoshihiro, (eds.) Chemoinformatics and Advanced Machine Learning Perspectives: Complex Computational Methods and Collaborative Techniques. IGI Global, Hershey, PA, USA, pp. 129-144. ISBN 9781615209118 ; 1615209115

[img]PDF (book chapter) - Registered users only until 2018 - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader

Official URL: http://dx.doi.org/10.4018/978-1-61520-911-8.ch007


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.

Item Type:Book Section / Chapter
Subjects:Q Science > Q Science (General)
ID Code:18106
Deposited By:Uğur Sezerman
Deposited On:07 Jan 2012 22:02
Last Modified:05 Mar 2019 14:34

Repository Staff Only: item control page