Proceedings of the first Malta conference on Graphs and combinatorics
A note on greedy algorithms for the maximum weighted independent set problem
Discrete Applied Mathematics
A Multiple Alignment Algorithm for Metabolic Pathway Analysis Using Enzyme Hierarchy
Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology
Alignment of metabolic pathways
Bioinformatics
Bioinformatics
Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs
CCC '09 Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity
Pairwise global alignment of protein interaction networks by matching neighborhood topology
RECOMB'07 Proceedings of the 11th annual international conference on Research in computational molecular biology
Functional similarities of reaction sets in metabolic pathways
Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology
A novel framework for large scale metabolic network alignments by compression
Proceedings of the 2nd ACM Conference on Bioinformatics, Computational Biology and Biomedicine
Topology aware coloring of gene regulatory networks
Proceedings of the 2nd ACM Conference on Bioinformatics, Computational Biology and Biomedicine
| Hi-index | 0.00 |
We consider the problem of aligning two metabolic pathways Unlike traditional approaches, we do not restrict the alignment to one-to-one mappings between the molecules of the input pathways We follow the observation that in nature different organisms can perform the same or similar functions through different sets of reactions and molecules The number and the topology of the molecules in these alternative sets often vary from one organism to another In other words, given two metabolic pathways of arbitrary topology, we would like to find a mapping that maximizes the similarity between the molecule subsets of query pathways of size at most a given integer k We transform this problem into an eigenvalue problem The solution to this eigenvalue problem produces alternative mappings in the form of a weighted bipartite graph We then convert this graph to a vertex weighted graph The maximum weight independent subset of this new graph is the alignment that maximizes the alignment score while ensuring consistency We call our algorithm SubMAP (Subnetwork Mappings in Alignment of Pathways) We evaluate its accuracy and performance on real datasets Our experiments demonstrate that SubMAP can identify biologically relevant mappings that are missed by traditional alignment methods and it is scalable for real size metabolic pathways. Availability: Our software and source code in C++ is available at http://bioinformatics.cise.ufl.edu/SubMAP.html