Fixed-parameter tractable combinatorial algorithms for metabolic networks alignments

Qiong Cheng, Jinpeng Wei, Alexander Zelikovsky, Mitsunori Ogihara

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The accumulation of high-throughput genomic and proteomic data allows for the reconstruction of the increasingly large and complex metabolic networks. In order to analyze accumulated data and reconstructed networks, it is critical to identify network patterns and evolutionary relations between metabolic networks. But even finding similar networks is computationally challenging. Based on the property of gene duplication and function sharing in biological network, we have formulated the network alignment problem which asks the optimal vertex-to-vertex mapping allowing path contraction, vertex deletion, and vertex insertions. In this paper we present fixed parameter tractable combinatorial algorithms, which take into account the enzymes' functions and the similarity of arbitrary network topologies such as trees and arbitrary graphs wit hallowing the different types of vertex deletions. The proposed algorithms are fixed parameter tractable in the liner or square of the size of feedback vertex set respectively for the case of disallowing or allowing the deletions. We have developed the web service tool MetNetAligner which aligns metabolic networks. We evaluated our results by the randomizedP-Value computation. In the computation, we followed two standard randomization procedures and further developed two other random graph generators which keep the more stringent and consistent topology constraints. By comparing their distribution of the significant alignment pairs, we observed that the more stringent constraints in the topology the random graph generator has, the more pairs of significant alignments there exist. We also performed pair wise mapping of all pathways for four organisms and found a set of statistically significant pathway similarities. We have applied the network alignment to identifying pathway holes which are resulted by inconsistency and missing enzymes. MetNetAligner is available at http://\\alla.cs.gsu.edu:8080/MinePW/pages/gmapping/GMMain.html Two random graph generations and the list of identified pathway holes are available online.

Original languageEnglish (US)
Title of host publicationProceedings - 10th IEEE International Conference on Data Mining Workshops, ICDMW 2010
Pages679-686
Number of pages8
DOIs
StatePublished - Dec 1 2010
Event10th IEEE International Conference on Data Mining Workshops, ICDMW 2010 - Sydney, NSW, Australia
Duration: Dec 14 2010Dec 17 2010

Publication series

NameProceedings - IEEE International Conference on Data Mining, ICDM
ISSN (Print)1550-4786

Other

Other10th IEEE International Conference on Data Mining Workshops, ICDMW 2010
CountryAustralia
CitySydney, NSW
Period12/14/1012/17/10

    Fingerprint

Keywords

  • Feedback vertex sets
  • Graph homeomorphism
  • Network alignment

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Cheng, Q., Wei, J., Zelikovsky, A., & Ogihara, M. (2010). Fixed-parameter tractable combinatorial algorithms for metabolic networks alignments. In Proceedings - 10th IEEE International Conference on Data Mining Workshops, ICDMW 2010 (pp. 679-686). [5693362] (Proceedings - IEEE International Conference on Data Mining, ICDM). https://doi.org/10.1109/ICDMW.2010.179