Incremental network querying in biological networks

Comparative network analysis finds similarities between a query and a target network by aligning them. Biological network evolves over time; and so does the topology of the query network extracted from it. We denote a sequence of query networks where each network in the sequence differs slightly from the preceding one as dynamically evolving queries. Existing network alignment methods consider each query network independently. Thus, the total cost of aligning all the query networks in a given sequence of dynamically evolving queries is equal to the sum of the alignment costs of all the individual networks in this sequence. This cost can be prohibitively expensive particularly for large queries as well as large sequence of queries. We develop an incremental network alignment method, named INQ, for aligning a sequence of dynamically evolving query networks to a target network. Unlike existing methods, INQ benefits from the alignment of each query network while aligning the next query network in the sequence. As a result, it cuts down the search space and thus the running time dramatically. To the best of our knowledge, this is the first study which aligns networks in an incremental fashion. Our extensive experiments on both real and synthetic networks demonstrate that INQ is orders of magnitude faster than existing methods such as ColT. We also demonstrate that the results of INQ are highly accurate even for very long sequence of query networks and INQ successfully finds functionally similar pathways in cross-species protein interactions networks.

[1]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[2]  Tamer Kahveci,et al.  Color distribution can accelerate network alignment , 2013, BCB.

[3]  Yongjin Park,et al.  How networks change with time , 2012, Bioinform..

[4]  Roded Sharan,et al.  QNet: A Tool for Querying Protein Interaction Networks , 2007, RECOMB.

[5]  Hiroyuki Ogata,et al.  KEGG: Kyoto Encyclopedia of Genes and Genomes , 1999, Nucleic Acids Res..

[6]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[7]  Sanjay Ranka,et al.  An Iterative Algorithm for Metabolic Network-Based Drug Target Identification , 2006, Pacific Symposium on Biocomputing.

[8]  Steven Skiena,et al.  Computational Discrete Mathematics: Combinatorics and Graph Theory with Mathematica ® , 2009 .

[9]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[10]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[11]  Tamer Kahveci,et al.  SubMAP: Aligning Metabolic Pathways with Subnetwork Mappings , 2010, J. Comput. Biol..

[12]  P. Shannon,et al.  Cytoscape: a software environment for integrated models of biomolecular interaction networks. , 2003, Genome research.

[13]  Tamer Kahveci,et al.  Topac: Alignment of gene Regulatory Networks Using Topology-Aware Coloring , 2012, J. Bioinform. Comput. Biol..

[14]  C. Francke,et al.  Reconstructing the metabolic network of a bacterium from its genome. , 2005, Trends in microbiology.

[15]  Mark Gerstein,et al.  Measuring the Evolutionary Rewiring of Biological Networks , 2011, PLoS Comput. Biol..

[16]  Roded Sharan,et al.  QPath: a method for querying pathways in a protein-protein interaction network , 2006, BMC Bioinformatics.

[17]  Kenji Satou,et al.  Finding conserved and non-conserved reactions using a metabolic pathway alignment algorithm. , 2006, Genome informatics. International Conference on Genome Informatics.

[18]  O. Kuchaiev,et al.  Topological network alignment uncovers biological function and phylogeny , 2008, Journal of The Royal Society Interface.

[19]  A. Barabasi,et al.  Network biology: understanding the cell's functional organization , 2004, Nature Reviews Genetics.

[20]  Bonnie Berger,et al.  IsoRankN: spectral methods for global alignment of multiple protein networks , 2009, Bioinform..

[21]  Mam Riess Jones Color Coding , 1962, Human factors.