title: Graemlin: general and robust alignment of multiple large interaction networks.
abstract: The recent proliferation of protein interaction networks has motivated research into network alignment: the cross-species comparison of conserved functional modules. Previous studies have laid the foundations for such comparisons and demonstrated their power on a select set of sparse interaction networks. Recently, however, new computational techniques have produced hundreds of predicted interaction networks with interconnection densities that push existing alignment algorithms to their limits. To find conserved functional modules in these new networks, we have developed Graemlin, the first algorithm capable of scalable multiple network alignment. Graemlin's explicit model of functional evolution allows both the generalization of existing alignment scoring schemes and the location of conserved network topologies other than protein complexes and metabolic pathways. To assess Graemlin's performance, we have developed the first quantitative benchmarks for network alignment, which allow comparisons of algorithms in terms of their ability to recapitulate the KEGG database of conserved functional modules. We find that Graemlin achieves substantial scalability gains over previous methods while improving sensitivity.
authors.affiliation: Department of Computer Science, Stanford University, Stanford, California 94305, USA.
authors.forename: Jason
authors.initials: J
authors.lastname: Flannick
authors.forename: Antal
authors.initials: A
authors.lastname: Novak
authors.forename: Balaji S
authors.initials: BS
authors.lastname: Srinivasan
authors.forename: Harley H
authors.initials: HH
authors.lastname: McAdams
authors.forename: Serafim
authors.initials: S
authors.lastname: Batzoglou
mesh_terms: D000465:Algorithms; D000818:Animals; D019295:Computational Biology / Q000379:methods*; D008954:Models, Biological; D025941:Protein Interaction Mapping / Q000379:methods*; D016415:Sequence Alignment; D020539:Sequence Analysis, Protein