RESUMEN

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 case-specific 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 gene-expression 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.

Asunto(s)

RESUMEN

BACKGROUND: Qualitative reasoning frameworks, such as the Sign Consistency Model (SCM), enable modelling regulatory networks to check whether observed behaviour can be explained or if unobserved behaviour can be predicted. The BioASP software collection offers ideal tools for such analyses. Additionally, the Cytoscape platform can offer extensive functionality and visualisation capabilities. However, specialist programming knowledge is required to use BioASP and no methods exist to integrate both of these software platforms effectively. RESULTS: We report the implementation of CytoASP, an app that allows the use of BioASP for influence graph consistency checking, prediction and repair operations through Cytoscape. While offering inherent benefits over traditional approaches using BioASP, it provides additional advantages such as customised visualisation of predictions and repairs, as well as the ability to analyse multiple networks in parallel, exploiting multi-core architecture. We demonstrate its usage in a case study of a yeast genetic network, and highlight its capabilities in reasoning over regulatory networks. CONCLUSION: We have presented a user-friendly Cytoscape app for the analysis of regulatory networks using BioASP. It allows easy integration of qualitative modelling, combining the functionality of BioASP with the visualisation and processing capability in Cytoscape, and thereby greatly simplifying qualitative network modelling, promoting its use in relevant projects.

Asunto(s)

RESUMEN

The detection of community structure is a widely accepted means of investigating the principles governing biological systems. Recent efforts are exploring ways in which multiple data sources can be integrated to generate a more comprehensive model of cellular interactions, leading to the detection of more biologically relevant communities. In this work, we propose a mathematical programming model to cluster multiplex biological networks, i.e. multiple network slices, each with a different interaction type, to determine a single representative partition of composite communities. Our method, known as SimMod, is evaluated through its application to yeast networks of physical, genetic and co-expression interactions. A comparative analysis involving partitions of the individual networks, partitions of aggregated networks and partitions generated by similar methods from the literature highlights the ability of SimMod to identify functionally enriched modules. It is further shown that SimMod offers enhanced results when compared to existing approaches without the need to train on known cellular interactions.

Asunto(s)

RESUMEN

We study the problem of a particle or message that travels as a biased random walk towards a target node in a network in the presence of traps. The bias is represented as the probability p of the particle to travel along the shortest path to the target node. The efficiency of the transmission process is expressed through the fraction f(g) of particles that succeed to reach the target without being trapped. By relating f(g) with the number S of nodes visited before reaching the target, we first show that, for the unbiased random walk, f(g) is inversely proportional to both the concentration c of traps and the size N of the network. For the case of biased walks, a simple approximation of S provides an analytical solution that describes well the behavior of f(g), especially for p>0.5. Also, it is shown that for a given value of the bias p, when the concentration of traps is less than a threshold value equal to the inverse of the mean first passage time (MFPT) between two randomly chosen nodes of the network, the efficiency of transmission is unaffected by the presence of traps and almost all the particles arrive at the target. As a consequence, for a given concentration of traps, we can estimate the minimum bias that is needed to have unaffected transmission, especially in the case of random regular (RR), Erdos-Rényi (ER) and scale-free (SF) networks, where an exact expression (RR and ER) or an upper bound (SF) of the MFPT is known analytically. We also study analytically and numerically, the fraction f(g) of particles that reach the target on SF networks, where a single trap is placed on the highest degree node. For the unbiased random walk, we find that f(g)∼N(-1/(γ-1)), where γ is the power law exponent of the SF network.

RESUMEN

In microarray data analysis, traditional methods that focus on single genes are increasingly replaced by methods that analyse functional units corresponding to biochemical pathways, as these are considered to offer more insight into gene expression and disease associations. However, the development of robust pipelines to relate genotypic functional modules to disease phenotypes through known molecular interactions is still at its early stages. In this article we first discuss methodologies that employ groups of genes in disease classification tasks that aim to link gene expression patterns with disease outcome. Then we present a pathway-based approach for disease classification through a mathematical programming model based on hyper-box principles. Association rules derived from the model are extracted and discussed with respect to pathway-specific molecular patterns related to the disease. Overall, we argue that the use of gene sets corresponding to disease-relevant pathways is a promising route to uncover expression-to-phenotype relations in disease classification and we illustrate the potential of hyper-box classification in assessing the predictive power of functional pathways and uncover the effect of specific genes in the prediction of disease phenotypes.

Asunto(s)

RESUMEN

Community structure detection has proven to be important in revealing the underlying properties of complex networks. The standard problem, where a partition of disjoint communities is sought, has been continually adapted to offer more realistic models of interactions in these systems. Here, a two-step procedure is outlined for exploring the concept of overlapping communities. First, a hard partition is detected by employing existing methodologies. We then propose a novel mixed integer non linear programming (MINLP) model, known as OverMod, which transforms disjoint communities to overlapping. The procedure is evaluated through its application to protein-protein interaction (PPI) networks of the rat, E. coli, yeast and human organisms. Connector nodes of hard partitions exhibit topological and functional properties indicative of their suitability as candidates for multiple module membership. OverMod identifies two types of connector nodes, inter and intra-connector, each with their own particular characteristics pertaining to their topological and functional role in the organisation of the network. Inter-connector proteins are shown to be highly conserved proteins participating in pathways that control essential cellular processes, such as proliferation, differentiation and apoptosis and their differences with intra-connectors is highlighted. Many of these proteins are shown to possess multiple roles of distinct nature through their participation in different network modules, setting them apart from proteins that are simply 'hubs', i.e. proteins with many interaction partners but with a more specific biochemical role.

Asunto(s)

RESUMEN

Community structure detection has proven to be important in revealing the underlying organisation of complex networks. While most current analyses focus on static networks, the detection of communities in dynamic data is both challenging and timely. An analysis and visualisation procedure for dynamic networks is presented here, which identifies communities and sub-communities that persist across multiple network snapshots. An existing method for community detection in dynamic networks is adapted, extended, and implemented. We demonstrate the applicability of this method to detect communities in networks where individuals tend not to change their community affiliation very frequently. When stability of communities cannot be assumed, we show that the sub-community model may be a better alternative. This is illustrated through test cases of social and biological networks. A plugin for Gephi, an open-source software program used for graph visualisation and manipulation, named "DyCoNet", was created to execute the algorithm and is freely available from https://github.com/juliemkauffman/DyCoNet.

Asunto(s)

RESUMEN

We study diffusion with a bias toward a target node in networks. This problem is relevant to efficient routing strategies in emerging communication networks like optical networks. Bias is represented by a probability p of the packet or particle to travel at every hop toward a site that is along the shortest path to the target node. We investigate the scaling of the mean first passage time (MFPT) with the size of the network. We find by using theoretical analysis and computer simulations that for random regular (RR) and Erdos-Rényi networks, there exists a threshold probability, p(th), such that for pp(th), the MFPT scales logarithmically with N. The threshold value p(th) of the bias parameter for which the regime transition occurs is found to depend only on the mean degree of the nodes. An exact solution for every value of p is given for the scaling of the MFPT in RR networks. The regime transition is also observed for the second moment of the probability distribution function, the standard deviation. For the case of scale-free (SF) networks, we present analytical bounds and simulations results showing that the MFPT scales at most as lnN to a positive power for any finite bias, which means that in SF networks even a very small bias is considerably more efficient in comparison to unbiased walk.

RESUMEN

Despite the increasing number of growth factor-related signalling networks, their lack of logical and causal connection to factual changes in cell states frequently impairs the functional interpretation of microarray data. We present a novel method enabling the automatic inference of causal multi-layer networks from such data, allowing the functional interpretation of growth factor stimulation experiments using pathway databases. Our environment of evaluation was hepatocyte growth factor-stimulated cell migration and proliferation in a keratinocyte-fibroblast co-culture. The network for this system was obtained by applying the steps: (a) automatic integration of the comprehensive set of all known cellular networks from the Pathway Interaction Database into a master structure; (b) retrieval of an active-network from the master structure, where the network edges that connect nodes with an absent mRNA level were excluded; and (c) reduction of the active-network complexity to a causal subnetwork from a set of seed nodes specific for the microarray experiment. The seed nodes comprised the receptors stimulated in the experiment, the consequently differentially expressed genes, and the expected cell states. The resulting network shows how well-known players, in the context of hepatocyte growth factor stimulation, are mechanistically linked in a pathway triggering functional cell state changes. Using BIOQUALI, we checked and validated the consistency of the network with respect to microarray data by computational simulation. The network has properties that can be classified into different functional layers because it not only shows signal processing down to the transcriptional level, but also the modulation of the network structure by the preceeding stimulation. The software for generating computable objects from the Pathway Interaction Database database, as well as the generated networks, are freely available at: http://www.tiga.uni-hd.de/supplements/inferringFromPID.html.

Asunto(s)

RESUMEN

In this work I introduce a simple model to study how natural selection acts upon aging, which focuses on the viability of each individual. It is able to reproduce the Gompertz law of mortality and can make predictions about the relation between the level of mutation rates (beneficial/deleterious/neutral), age at reproductive maturity and the degree of biological aging. With no mutations, a population with low age at reproductive maturity R stabilizes at higher density values, while with mutations it reaches its maximum density, because even for large pre-reproductive periods each individual evolves to survive to maturity. Species with very short pre-reproductive periods can only tolerate a small number of detrimental mutations. The probabilities of detrimental (P(d)) or beneficial (P(b)) mutations are demonstrated to greatly affect the process. High absolute values produce peaks in the viability of the population over time. Mutations combined with low selection pressure move the system towards weaker phenotypes. For low values in the ratio P(d)/P(b), the speed at which aging occurs is almost independent of R, while higher values favor significantly species with high R. The value of R is critical to whether the population survives or dies out. The aging rate is controlled by P(d) and P(b) and the amount of the viability of each individual is modified, with neutral mutations allowing the system more "room" to evolve. The process of aging in this simple model is revealed to be fairly complex, yielding a rich variety of results.

Asunto(s)

RESUMEN

We study the dynamics of the infection of a two mobile species reaction from a single infected agent in a population of healthy agents. Historically, the main focus for infection propagation has been through spreading phenomena, where a random location of the system is initially infected and then propagates by successfully infecting its neighbor sites. Here both the infected and healthy agents are mobile, performing classical random walks. This may be a more realistic picture to such epidemiological models, such as the spread of a virus in communication networks of routers, where data travel in packets, the communication time of stations in ad hoc mobile networks, information spreading (such as rumor spreading) in social networks, etc. We monitor the density of healthy particles ρ(t), which we find in all cases to be an exponential function in the long-time limit in two-dimensional and three-dimensional lattices and Erdos-Rényi (ER) and scale-free (SF) networks. We also investigate the scaling of the crossover time t(c) from short- to long-time exponential behavior, which we find to be a power law in lattices and ER networks. This crossover is shown to be absent in SF networks, where we reveal the role of the connectivity of the network in the infection process. We compare this behavior to ER networks and lattices and highlight the significance of various connectivity patterns, as well as the important differences of this process in the various underlying geometries, revealing a more complex behavior of ρ(t).

Asunto(s)

RESUMEN

In the present work we examine in detail the formation of a depletion zone in the trapping reaction in networks, with a single perfect trap. We monitor the particle density rho(r) with respect to the distance r from the trap. We show using Monte Carlo simulations that the depletion zone is absent in regular, Erdos-Renyi (ER), and scale-free (SF) networks. The density profiles show significant differences for these cases. The particles are homogeneously distributed in regular and ER networks with the depletion effect appearing in very sparse ER networks. In SF networks we reveal the important role of the hubs, which due to their high random walk centrality are critical in the trapping reaction. In addition, the degree distribution plays a significant role in the distribution of the particles recovering the depletion zone formation for high gamma values. The mean connectivity of the network is found to play a significant role in both ER and SF networks.

Asunto(s)