Pairwise alignment of interaction networks by fast identification of maximal conserved patterns.
A number of tools for the alignment of protein-protein interaction (PPI) networks have laid the foundation for PPI network analysis. They typically find conserved interaction patterns by various local or global search algorithms, and then validate the results using genome annotation. The improvement of the speed, scalability and accuracy of network alignment is still the target of ongoing research. In view of this, we introduce a connected-components based algorithm, called HopeMap for pairwise network alignment with the focus on fast identification of maximal conserved patterns across species. Observing that the number of true homologs across species is relatively small compared to the total number of proteins in all species, we start with highly homologous groups across species, find maximal conserved interaction patterns globally with a generic scoring system, and validate the results across multiple known functional annotations. The results are evaluated in terms of statistical enrichment of gene ontology (GO) terms and KEGG ortholog groups (KO) within conserved interaction patters. HopeMap is fast, with linear computational cost, accurate in terms of KO groups and GO terms specificity and sensitivity, and extensible to multiple network alignment.
Tian
Wenhong
W
Department of Computer and Mathematics Division, Oak Ridge National Laboratory, Oak Ridge, TN 37831, USA. wenhong_tian@hotmail.com
Samatova
Nagiza F
NF
D000465:Algorithms; D000818:Animals; D001699:Biometry; D030562:Databases, Protein; D010363:Pattern Recognition, Automated; D054730:Protein Interaction Domains and Motifs / Q000235:genetics; D025941:Protein Interaction Mapping / Q000706:statistics & numerical data*; D011506:Proteins / Q000737:chemistry / Q000235:genetics; D016415:Sequence Alignment / Q000706:statistics & numerical data; D049490:Systems Biology
D011506:Proteins