Welcome to the InfoSci Platform
Reference Hub2
Protein Homology Analysis for Function Prediction with Parallel Sub-Graph Isomorphism

Protein Homology Analysis for Function Prediction with Parallel Sub-Graph Isomorphism

Alper Küçükural, Andras Szilagyi, O. Ugur Sezerman, Yang Zhang
Copyright: © 2013 |Pages: 14
ISBN13: 9781466636040|ISBN10: 1466636041|EISBN13: 9781466636057
DOI: 10.4018/978-1-4666-3604-0.ch021
Cite Chapter Cite Chapter

MLA

Küçükural, Alper, et al. "Protein Homology Analysis for Function Prediction with Parallel Sub-Graph Isomorphism." Bioinformatics: Concepts, Methodologies, Tools, and Applications, edited by Information Resources Management Association, IGI Global, 2013, pp. 386-399. https://doi.org/10.4018/978-1-4666-3604-0.ch021

APA

Küçükural, A., Szilagyi, A., Sezerman, O. U., & Zhang, Y. (2013). Protein Homology Analysis for Function Prediction with Parallel Sub-Graph Isomorphism. In I. Management Association (Ed.), Bioinformatics: Concepts, Methodologies, Tools, and Applications (pp. 386-399). IGI Global. https://doi.org/10.4018/978-1-4666-3604-0.ch021

Chicago

Küçükural, Alper, et al. "Protein Homology Analysis for Function Prediction with Parallel Sub-Graph Isomorphism." In Bioinformatics: Concepts, Methodologies, Tools, and Applications, edited by Information Resources Management Association, 386-399. Hershey, PA: IGI Global, 2013. https://doi.org/10.4018/978-1-4666-3604-0.ch021

Export Reference

Mendeley
Favorite

Abstract

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.