Directed random walks and constraint programming reveal active pathways in hepatocyte growth factor signaling

Abstract

An effective means to analyze mRNA expression data is to take advantage of established knowledge from pathway databases, using methods such as pathway-enrichment analyses. However, pathway databases are not casespecific and expression data could be used to infer gene-regulation patterns in the context of specific pathways. In addition, canonical pathways may not always describe the signaling mechanisms properly, because interactions can frequently occur between genes in different pathways. Relatively few methods have been proposed to date for generating and analyzing such networks, preserving the causality between gene interactions and reasoning over the qualitative logic of regulatory effects. We present an algorithm (MCWalk) integrated with a logic programming approach, to discover subgraphs in large-scale signaling networks by random walks in a fully automated pipeline. As an exemplary application, we uncover the signal transduction mechanisms in a gene interaction network describing hepatocyte growth factor-stimulated cell migration and proliferation from geneexpression measured with microarray and RT-qPCR using in-house perturbation experiments in a keratinocyte-fibroblast co-culture. The resulting subgraphs illustrate possible associations of hepatocyte growth factor receptor c-Met nodes, differentially expressed genes and cellular states. Using perturbation experiments and Answer Set programming, we are able to select those which are more consistent with the experimental data. We discover key regulator nodes by measuring the frequency with which they are traversed when connecting signaling between receptors and significantly regulated genes and predict their expression-shift consistently with the measured data. The Java implementation of MCWalk is publicly available under the MIT license at: https://bitbucket.org/akittas/biosubg.

Formatting biological big data for modern machine learning in drug discovery

“…Without benchmark tests that refer to the phenotypic property of interest, traversal of the network by, for example, random walks may be erratic, exploring irrelevant regions of the graph while omitting the really predictive ones. Related to this, research is needed to identify meaningful meta‐paths and devise network sampling procedures that simulate complicated phenomena such as gene regulation, spatial organization or time‐resolved dynamics …”

Non-Coding RNAs in the Brain-Heart Axis: The Case of Parkinson’s Disease

“…The corresponding algorithms investigate entire genome-scale molecular networks to identify sub-networks with coordinated activity changes. They provide more complete coverage of the cellular process alterations than pathway analysis methods, but often lack the interpretability of compact, manually curated pathway definitions [210,211]. Apart from identifying local network perturbations, some of the more recently developed algorithms also enable causal network explorations.…”

Integrating Protein Localization with Automated Signaling Pathway Reconstruction

“…A handful of the initial methods were applied to human signaling, including the apoptosis pathway [11] and the immune response network [12]. Approaches for identifying relevant static sub-networks have drawn on different graph theoretic methods, including shortest paths [13,14], Steiner trees and related formulations [15,16], network flow [9,17] and random walk approaches [18][19][20].…”