IMADA - Department of Mathematics and Computer Science |
Systems biology has emerged over the last decade. Driven by the advances in sophisticated measurement technology the research community generated huge molecular biology data sets. This comprises rather static data on the interplay of biological entities, for instance protein-protein interaction network data, as well as quite dynamic data collected for studying the behavior of individual cells or tissues in accordance to changing environmental conditions, such as DNA microarrays, RNA sequencing or genome-wide methylation assays. Here we bring the two different data types together for unraveling the molecular basis of complex diseases, such as cancer. Therefor, we developed KeyPathwayMiner. Given a biological network modeled as graph and a set of expression studies, KeyPathwayMiner efficiently finds and visualizes connected sub-networks where most components are expressed in most cases. It identifies all maximal connected sub-networks where all nodes but K exceptions are expressed in all experimental studies but at least L exceptions. I will briefly introduce a set of exact and heuristic algorithms that tackle this NP-hard combinatorial optimization problem. I will demonstrate the power of KeyPathwayMiner by comparing it to similar approaches with gene expression data previously used to study Huntington's disease. In addition, we demonstrate its flexibility and applicability to non-array data by analyzing genome-scale DNA methylation profiles from colorectal tumor cancer patients. KeyPathwayMiner is available as Java library, as a Cytoscape plugin and online at http://keypathwayminer.mpi-inf.mpg.de
[1] Alcaraz NM, Friedrich T, Koetzing T, Krohmer A, Mueller J, Pauling J,
Baumbach J (2012) Efficient key pathway mining - Combining networks and
OMICS data. Integr Biol. 2012 (in press). DOI: 10.1039/C2IB00133K. Host: Martin Svensson SDU HOME | IMADA HOME | Previous Page Daniel Merkle |