MIMO: an efficient tool for molecular interaction maps overlap
1 CAS Key Laboratory For Computational Biology Chinese Academy of Sciences - Max Plank Institute Partner Institute for Computational Biology, Yue Yang Road 320, Shanghai, 200031, P.R.C
2 Department of Computer Science and Engineering - DISIUniversity of Bologna, Mura Anteo Zamboni 7, Bologna, 40126, Italy
3 Biocomputing Group, University of Bologna, Via San Giacomo 9/2, Bologna, 40126, Italy
BMC Bioinformatics 2013, 14:159 doi:10.1186/1471-2105-14-159Published: 15 May 2013
Molecular pathways represent an ensemble of interactions occurring among molecules within the cell and between cells. The identification of similarities between molecular pathways across organisms and functions has a critical role in understanding complex biological processes. For the inference of such novel information, the comparison of molecular pathways requires to account for imperfect matches (flexibility) and to efficiently handle complex network topologies. To date, these characteristics are only partially available in tools designed to compare molecular interaction maps.
Our approach MIMO (Molecular Interaction Maps Overlap) addresses the first problem by allowing the introduction of gaps and mismatches between query and template pathways and permits -when necessary- supervised queries incorporating a priori biological information. It then addresses the second issue by relying directly on the rich graph topology described in the Systems Biology Markup Language (SBML) standard, and uses multidigraphs to efficiently handle multiple queries on biological graph databases. The algorithm has been here successfully used to highlight the contact point between various human pathways in the Reactome database.
MIMO offers a flexible and efficient graph-matching tool for comparing complex biological pathways.