782 research outputs found
Spectral plots and the representation and interpretation of biological data
It is basic question in biology and other fields to identify the char-
acteristic properties that on one hand are shared by structures from a
particular realm, like gene regulation, protein-protein interaction or neu- ral
networks or foodwebs, and that on the other hand distinguish them from other
structures. We introduce and apply a general method, based on the spectrum of
the normalized graph Laplacian, that yields repre- sentations, the spectral
plots, that allow us to find and visualize such properties systematically. We
present such visualizations for a wide range of biological networks and compare
them with those for networks derived from theoretical schemes. The differences
that we find are quite striking and suggest that the search for universal
properties of biological networks should be complemented by an understanding of
more specific features of biological organization principles at different
scales.Comment: 15 pages, 7 figure
Patterns of subnet usage reveal distinct scales of regulation in the transcriptional regulatory network of Escherichia coli
The set of regulatory interactions between genes, mediated by transcription
factors, forms a species' transcriptional regulatory network (TRN). By
comparing this network with measured gene expression data one can identify
functional properties of the TRN and gain general insight into transcriptional
control. We define the subnet of a node as the subgraph consisting of all nodes
topologically downstream of the node, including itself. Using a large set of
microarray expression data of the bacterium Escherichia coli, we find that the
gene expression in different subnets exhibits a structured pattern in response
to environmental changes and genotypic mutation. Subnets with less changes in
their expression pattern have a higher fraction of feed-forward loop motifs and
a lower fraction of small RNA targets within them. Our study implies that the
TRN consists of several scales of regulatory organization: 1) subnets with more
varying gene expression controlled by both transcription factors and
post-transcriptional RNA regulation, and 2) subnets with less varying gene
expression having more feed-forward loops and less post-transcriptional RNA
regulation.Comment: 14 pages, 8 figures, to be published in PLoS Computational Biolog
Colored Motifs Reveal Computational Building Blocks in the C. elegans Brain
Background: Complex networks can often be decomposed into less complex sub-networks whose structures can give hints about the functional
organization of the network as a whole. However, these structural
motifs can only tell one part of the functional story because in this
analysis each node and edge is treated on an equal footing. In real
networks, two motifs that are topologically identical but whose nodes
perform very different functions will play very different roles in the
network.
Methodology/Principal Findings: Here, we combine structural information
derived from the topology of the neuronal network of the nematode C.
elegans with information about the biological function of these nodes,
thus coloring nodes by function. We discover that particular
colorations of motifs are significantly more abundant in the worm brain
than expected by chance, and have particular computational functions
that emphasize the feed-forward structure of information processing in
the network, while evading feedback loops. Interneurons are strongly
over-represented among the common motifs, supporting the notion that
these motifs process and transduce the information from the sensor
neurons towards the muscles. Some of the most common motifs identified
in the search for significant colored motifs play a crucial role in the
system of neurons controlling the worm's locomotion.
Conclusions/Significance: The analysis of complex networks in terms of
colored motifs combines two independent data sets to generate insight
about these networks that cannot be obtained with either data set
alone. The method is general and should allow a decomposition of any
complex networks into its functional (rather than topological) motifs
as long as both wiring and functional information is available
The identification of informative genes from multiple datasets with increasing complexity
Background
In microarray data analysis, factors such as data quality, biological variation, and the increasingly multi-layered nature of more complex biological systems complicates the modelling of regulatory networks that can represent and capture the interactions among genes. We believe that the use of multiple datasets derived from related biological systems leads to more robust models. Therefore, we developed a novel framework for modelling regulatory networks that involves training and evaluation on independent datasets. Our approach includes the following steps: (1) ordering the datasets based on their level of noise and informativeness; (2) selection of a Bayesian classifier with an appropriate level of complexity by evaluation of predictive performance on independent data sets; (3) comparing the different gene selections and the influence of increasing the model complexity; (4) functional analysis of the informative genes.
Results
In this paper, we identify the most appropriate model complexity using cross-validation and independent test set validation for predicting gene expression in three published datasets related to myogenesis and muscle differentiation. Furthermore, we demonstrate that models trained on simpler datasets can be used to identify interactions among genes and select the most informative. We also show that these models can explain the myogenesis-related genes (genes of interest) significantly better than others (P < 0.004) since the improvement in their rankings is much more pronounced. Finally, after further evaluating our results on synthetic datasets, we show that our approach outperforms a concordance method by Lai et al. in identifying informative genes from multiple datasets with increasing complexity whilst additionally modelling the interaction between genes.
Conclusions
We show that Bayesian networks derived from simpler controlled systems have better performance than those trained on datasets from more complex biological systems. Further, we present that highly predictive and consistent genes, from the pool of differentially expressed genes, across independent datasets are more likely to be fundamentally involved in the biological process under study. We conclude that networks trained on simpler controlled systems, such as in vitro experiments, can be used to model and capture interactions among genes in more complex datasets, such as in vivo experiments, where these interactions would otherwise be concealed by a multitude of other ongoing events
Signatures of arithmetic simplicity in metabolic network architecture
Metabolic networks perform some of the most fundamental functions in living
cells, including energy transduction and building block biosynthesis. While
these are the best characterized networks in living systems, understanding
their evolutionary history and complex wiring constitutes one of the most
fascinating open questions in biology, intimately related to the enigma of
life's origin itself. Is the evolution of metabolism subject to general
principles, beyond the unpredictable accumulation of multiple historical
accidents? Here we search for such principles by applying to an artificial
chemical universe some of the methodologies developed for the study of genome
scale models of cellular metabolism. In particular, we use metabolic flux
constraint-based models to exhaustively search for artificial chemistry
pathways that can optimally perform an array of elementary metabolic functions.
Despite the simplicity of the model employed, we find that the ensuing pathways
display a surprisingly rich set of properties, including the existence of
autocatalytic cycles and hierarchical modules, the appearance of universally
preferable metabolites and reactions, and a logarithmic trend of pathway length
as a function of input/output molecule size. Some of these properties can be
derived analytically, borrowing methods previously used in cryptography. In
addition, by mapping biochemical networks onto a simplified carbon atom
reaction backbone, we find that several of the properties predicted by the
artificial chemistry model hold for real metabolic networks. These findings
suggest that optimality principles and arithmetic simplicity might lie beneath
some aspects of biochemical complexity
HiNO: An Approach for Inferring Hierarchical Organization from Regulatory Networks
BACKGROUND: Gene expression as governed by the interplay of the components of regulatory networks is indeed one of the most complex fundamental processes in biological systems. Although several methods have been published to unravel the hierarchical structure of regulatory networks, weaknesses such as the incorrect or inconsistent assignment of elements to their hierarchical levels, the incapability to cope with cyclic dependencies within the networks or the need for a manual curation to retrieve non-overlapping levels remain unsolved. METHODOLOGY/RESULTS: We developed HiNO as a significant improvement of the so-called breadth-first-search (BFS) method. While BFS is capable of determining the overall hierarchical structures from gene regulatory networks, it especially has problems solving feed-forward type of loops leading to conflicts within the level assignments. We resolved these problems by adding a recursive correction approach consisting of two steps. First each vertex is placed on the lowest level that this vertex and its regulating vertices are assigned to (downgrade procedure). Second, vertices are assigned to the next higher level (upgrade procedure) if they have successors with the same level assignment and have themselves no regulators. We evaluated HiNO by comparing it with the BFS method by applying them to the regulatory networks from Saccharomyces cerevisiae and Escherichia coli, respectively. The comparison shows clearly how conflicts in level assignment are resolved in HiNO in order to produce correct hierarchical structures even on the local levels in an automated fashion. CONCLUSIONS: We showed that the resolution of conflicting assignments clearly improves the BFS-method. While we restricted our analysis to gene regulatory networks, our approach is suitable to deal with any directed hierarchical networks structure such as the interaction of microRNAs or the action of non-coding RNAs in general. Furthermore we provide a user-friendly web-interface for HiNO that enables the extraction of the hierarchical structure of any directed regulatory network. AVAILABILITY: HiNO is freely accessible at http://mips.helmholtz-muenchen.de/hino/
Null Models of Economic Networks: The Case of the World Trade Web
In all empirical-network studies, the observed properties of economic
networks are informative only if compared with a well-defined null model that
can quantitatively predict the behavior of such properties in constrained
graphs. However, predictions of the available null-model methods can be derived
analytically only under assumptions (e.g., sparseness of the network) that are
unrealistic for most economic networks like the World Trade Web (WTW). In this
paper we study the evolution of the WTW using a recently-proposed family of
null network models. The method allows to analytically obtain the expected
value of any network statistic across the ensemble of networks that preserve on
average some local properties, and are otherwise fully random. We compare
expected and observed properties of the WTW in the period 1950-2000, when
either the expected number of trade partners or total country trade is kept
fixed and equal to observed quantities. We show that, in the binary WTW,
node-degree sequences are sufficient to explain higher-order network properties
such as disassortativity and clustering-degree correlation, especially in the
last part of the sample. Conversely, in the weighted WTW, the observed sequence
of total country imports and exports are not sufficient to predict higher-order
patterns of the WTW. We discuss some important implications of these findings
for international-trade models.Comment: 39 pages, 46 figures, 2 table
UVB-Induced Tumor Heterogeneity Diminishes Immune Response in Melanoma
Although clonal neo-antigen burden is associated with improved response to immune therapy, the functional basis for this remains unclear. Here we study this question in a novel controlled mouse melanoma model that enables us to explore the effects of intra-tumor heterogeneity (ITH) on tumor aggressiveness and immunity independent of tumor mutational burden. Induction of UVB-derived mutations yields highly aggressive tumors with decreased anti-tumor activity. However, single-cell-derived tumors with reduced ITH are swiftly rejected. Their rejection is accompanied by increased T cell reactivity and a less suppressive microenvironment. Using phylogenetic analyses and mixing experiments of single-cell clones, we dissect two characteristics of ITH: the number of clones forming the tumor and their clonal diversity. Our analysis of melanoma patient tumor data recapitulates our results in terms of overall survival and response to immune checkpoint therapy. These findings highlight the importance of clonal mutations in robust immune surveillance and the need to quantify patient ITH to determine the response to checkpoint blockade
- …