A network synthesis model for generating protein interaction network families.
In this work, we introduce a novel network synthesis model that can generate families of evolutionarily related synthetic protein-protein interaction (PPI) networks. Given an ancestral network, the proposed model generates the network family according to a hypothetical phylogenetic tree, where the descendant networks are obtained through duplication and divergence of their ancestors, followed by network growth using network evolution models. We demonstrate that this network synthesis model can effectively create synthetic networks whose internal and cross-network properties closely resemble those of real PPI networks. The proposed model can serve as an effective framework for generating comprehensive benchmark datasets that can be used for reliable performance assessment of comparative network analysis algorithms. Using this model, we constructed a large-scale network alignment benchmark, called NAPAbench, and evaluated the performance of several representative network alignment algorithms. Our analysis clearly shows the relative performance of the leading network algorithms, with their respective advantages and disadvantages. The algorithm and source code of the network synthesis model and the network alignment benchmark NAPAbench are publicly available at http://www.ece.tamu.edu/bjyoon/NAPAbench/.
Department of Electrical and Computer Engineering, Texas A&M University, College Station, Texas, United States of America.
Sayed Mohammad Ebrahim
SM
Sahraeian
Byung-Jun
BJ
Yoon
D000465:Algorithms; D000818:Animals; D019985:Benchmarking; D019295:Computational Biology / Q000379:methods*; D019143:Evolution, Molecular; D006801:Humans; D051379:Mice; D015233:Models, Statistical; D010802:Phylogeny; D060066:Protein Interaction Maps; D017386:Sequence Homology, Amino Acid