Graemlin: general and robust alignment of multiple large interaction networks. 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 Græmlin, the first algorithm capable of scalable multiple network alignment. Græmlin’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 Græmlin’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 Græmlin achieves substantial scalability gains over previous methods while improving sensitivity.

References in zbMATH (referenced in 5 articles )

Showing results 1 to 5 of 5.
Sorted by year (citations)

  1. Erciyes, K.: Distributed and sequential algorithms for bioinformatics (2015)
  2. Fionda, Valeria: Biological network analysis and comparison: mining new biological knowledge (2011) ioport
  3. Karp, Richard M.: Heuristic algorithms in computational molecular biology (2011)
  4. Heath, Allison P.; Kavraki, Lydia E.: Computational challenges in systems biology (2009)
  5. Klau, Gunnar W.: A new graph-based method for pairwise global network alignment (2009) ioport