Global Alignment of Pairwise Protein Interaction Networks for Maximal Common Conserved Patterns
Author(s) -
Wenhong Tian,
Nagiza F. Samatova
Publication year - 2013
Publication title -
international journal of genomics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.705
H-Index - 24
eISSN - 2314-4378
pISSN - 2314-436X
DOI - 10.1155/2013/670623
Subject(s) - pairwise comparison , structural alignment , biology , computer science , computational biology , mathematics , genetics , sequence alignment , artificial intelligence , gene , peptide sequence
A number of tools for the alignment of protein-protein interaction (PPI) networks have laid the foundation for PPI network analysis. Most of alignment tools focus on finding conserved interaction regions across the PPI networks through either local or global mapping of similar sequences. Researchers are still trying to improve the speed, scalability, and accuracy of network alignment. In view of this, we introduce a connected-components based fast algorithm, HopeMap, for network alignment. Observing that the size of true orthologs across species is small comparing to the total number of proteins in all species, we take a different approach based on a precompiled list of homologs identified by KO terms. Applying this approach to S. cerevisiae (yeast) and D. melanogaster (fly), E. coli K12 and S. typhimurium , E. coli K12 and C. crescenttus , we analyze all clusters identified in the alignment. The results are evaluated through up-to-date known gene annotations, gene ontology (GO), and KEGG ortholog groups (KO). Comparing to existing tools, our approach is fast with linear computational cost, highly accurate in terms of KO and GO terms specificity and sensitivity, and can be extended to multiple alignments easily.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom