Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Dynamic properties of network motifs contribute to biological network organization.

ABSTRACT: Biological networks, such as those describing gene regulation, signal transduction, and neural synapses, are representations of large-scale dynamic systems. Discovery of organizing principles of biological networks can be enhanced by embracing the notion that there is a deep interplay between network structure and system dynamics. Recently, many structural characteristics of these non-random networks have been identified, but dynamical implications of the features have not been explored comprehensively. We demonstrate by exhaustive computational analysis that a dynamical property--stability or robustness to small perturbations--is highly correlated with the relative abundance of small subnetworks (network motifs) in several previously determined biological networks. We propose that robust dynamical stability is an influential property that can determine the non-random structure of biological networks.

SUBMITTER: Prill RJ

PROVIDER: S-EPMC1239925 | biostudies-literature | 2005 Nov

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Dynamic properties of network motifs contribute to biological network organization.

Prill Robert J RJ Iglesias Pablo A PA Levchenko Andre A

PLoS biology 20051004 11

Biological networks, such as those describing gene regulation, signal transduction, and neural synapses, are representations of large-scale dynamic systems. Discovery of organizing principles of biological networks can be enhanced by embracing the notion that there is a deep interplay between network structure and system dynamics. Recently, many structural characteristics of these non-random networks have been identified, but dynamical implications of the features have not been explored comprehe ...[more]

PMID: 16187794

Similar Datasets

Ordered cyclic motifs contribute to dynamic stability in biological and engineered networks.

Project description:Representation and analysis of complex biological and engineered systems as directed networks is useful for understanding their global structure/function organization. Enrichment of network motifs, which are over-represented subgraphs in real networks, can be used for topological analysis. Because counting network motifs is computationally expensive, only characterization of 3- to 5-node motifs has been previously reported. In this study we used a supercomputer to analyze cyclic motifs made of 3-20 nodes for 6 biological and 3 technological networks. Using tools from statistical physics, we developed a theoretical framework for characterizing the ensemble of cyclic motifs in real networks. We have identified a generic property of real complex networks, antiferromagnetic organization, which is characterized by minimal directional coherence of edges along cyclic subgraphs, such that consecutive links tend to have opposing direction. As a consequence, we find that the lack of directional coherence in cyclic motifs leads to depletion in feedback loops, where the number of nodes affected by feedback loops appears to be at a local minimum compared with surrogate shuffled networks. This topology provides more dynamic stability in large networks.

| S-EPMC2614745 | biostudies-literature

Application of dynamic expansion tree for finding large network motifs in biological networks.

Project description:Network motifs play an important role in the structural analysis of biological networks. Identification of such network motifs leads to many important applications such as understanding the modularity and the large-scale structure of biological networks, classification of networks into super-families, and protein function annotation. However, identification of large network motifs is a challenging task as it involves the graph isomorphism problem. Although this problem has been studied extensively in the literature using different computational approaches, still there is a lot of scope for improvement. Motivated by the challenges involved in this field, an efficient and scalable network motif finding algorithm using a dynamic expansion tree is proposed. The novelty of the proposed algorithm is that it avoids computationally expensive graph isomorphism tests and overcomes the space limitation of the static expansion tree (SET) which makes it enable to find large motifs. In this algorithm, the embeddings corresponding to a child node of the expansion tree are obtained from the embeddings of a parent node, either by adding a vertex or by adding an edge. This process does not involve any graph isomorphism check. The time complexity of vertex addition and edge addition are O(n) and O(1), respectively. The growth of a dynamic expansion tree (DET) depends on the availability of patterns in the target network. Pruning of branches in the DET significantly reduces the space requirement of the SET. The proposed algorithm has been tested on a protein-protein interaction network obtained from the MINT database. The proposed algorithm is able to identify large network motifs faster than most of the existing motif finding algorithms.

| S-EPMC6526900 | biostudies-literature

Detecting biological network organization and functional gene orthologs.

Project description:SummaryWe developed a package TripletSearch to compute relationships within triplets of genes based on Roundup, an orthologous gene database containing >1500 genomes. These relationships, derived from the coevolution of genes, provide valuable information in the detection of biological network organization from the local to the system level, in the inference of protein functions and in the identification of functional orthologs. To run the computation, users need to provide the GI IDs of the genes of interest.Availabilityhttp://wall.hms.harvard.edu/sites/default/files/tripletSearch.tar.gzContactdpwall@hms.harvard.eduSupplementary informationSupplementary data are available at Bioinformatics online.

| S-EPMC3187654 | biostudies-literature

Switch-like Transitions Insulate Network Motifs to Modularize Biological Networks.

Project description:Cellular decisions are made by complex networks that are difficult to analyze. Although it is common to analyze smaller sub-networks known as network motifs, it is unclear whether this is valid, because these motifs are embedded in complex larger networks. Here, we address the general question of modularity by examining the S. cerevisiae pheromone response. We demonstrate that the feedforward motif controlling the cell-cycle inhibitor Far1 is insulated from cell-cycle dynamics by the positive feedback switch that drives reentry to the cell cycle. Before cells switch on positive feedback, the feedforward motif model predicts the behavior of the larger network. Conversely, after the switch, the feedforward motif is dismantled and has no discernable effect on the cell cycle. When insulation is broken, the feedforward motif no longer predicts network behavior. This work illustrates how, despite the interconnectivity of networks, the activity of motifs can be insulated by switches that generate well-defined cellular states.

| S-EPMC5001915 | biostudies-literature

Properties of metabolic graphs: biological organization or representation artifacts?

Project description:BackgroundStandard graphs, where each edge links two nodes, have been extensively used to represent the connectivity of metabolic networks. It is based on this representation that properties of metabolic networks, such as hierarchical and small-world structures, have been elucidated and null models have been proposed to derive biological organization hypotheses. However, these graphs provide a simplistic model of a metabolic network's connectivity map, since metabolic reactions often involve more than two reactants. In other words, this map is better represented as a hypergraph. Consequently, a question that naturally arises in this context is whether these properties truly reflect biological organization or are merely an artifact of the representation.ResultsIn this paper, we address this question by reanalyzing topological properties of the metabolic network of Escherichia coli under a hypergraph representation, as well as standard graph abstractions. We find that when clustering is properly defined for hypergraphs and subsequently used to analyze metabolic networks, the scaling of clustering, and thus the hierarchical structure hypothesis in metabolic networks, become unsupported. Moreover, we find that incorporating the distribution of reaction sizes into the null model further weakens the support for the scaling patterns.ConclusionsThese results combined suggest that the reported scaling of the clustering coefficients in the metabolic graphs and its specific power coefficient may be an artifact of the graph representation, and may not be supported when biochemical reactions are atomically treated as hyperedges. This study highlights the implications of the way a biological system is represented and the null model employed on the elucidated properties, along with their support, of the system.

| S-EPMC3098788 | biostudies-literature

Phylogenetically informed logic relationships improve detection of biological network organization.

Project description:BackgroundA "phylogenetic profile" refers to the presence or absence of a gene across a set of organisms, and it has been proven valuable for understanding gene functional relationships and network organization. Despite this success, few studies have attempted to search beyond just pairwise relationships among genes. Here we search for logic relationships involving three genes, and explore its potential application in gene network analyses.ResultsTaking advantage of a phylogenetic matrix constructed from the large orthologs database Roundup, we invented a method to create balanced profiles for individual triplets of genes that guarantee equal weight on the different phylogenetic scenarios of coevolution between genes. When we applied this idea to LAPP, the method to search for logic triplets of genes, the balanced profiles resulted in significant performance improvement and the discovery of hundreds of thousands more putative triplets than unadjusted profiles. We found that logic triplets detected biological network organization and identified key proteins and their functions, ranging from neighbouring proteins in local pathways, to well separated proteins in the whole pathway, and to the interactions among different pathways at the system level. Finally, our case study suggested that the directionality in a logic relationship and the profile of a triplet could disclose the connectivity between the triplet and surrounding networks.ConclusionBalanced profiles are superior to the raw profiles employed by traditional methods of phylogenetic profiling in searching for high order gene sets. Gene triplets can provide valuable information in detection of biological network organization and identification of key genes at different levels of cellular interaction.

| S-EPMC3402364 | biostudies-literature

Nonlinear delay differential equations and their application to modeling biological network motifs.

Project description:Biological regulatory systems, such as cell signaling networks, nervous systems and ecological webs, consist of complex dynamical interactions among many components. Network motif models focus on small sub-networks to provide quantitative insight into overall behavior. However, such models often overlook time delays either inherent to biological processes or associated with multi-step interactions. Here we systematically examine explicit-delay versions of the most common network motifs via delay differential equation (DDE) models, both analytically and numerically. We find many broadly applicable results, including parameter reduction versus canonical ordinary differential equation (ODE) models, analytical relations for converting between ODE and DDE models, criteria for when delays may be ignored, a complete phase space for autoregulation, universal behaviors of feedforward loops, a unified Hill-function logic framework, and conditions for oscillations and chaos. We conclude that explicit-delay modeling simplifies the phenomenology of many biological networks and may aid in discovering new functional motifs.

| S-EPMC7979834 | biostudies-literature

Abnormal dynamic resting-state brain network organization in auditory verbal hallucination.

Project description:Auditory-verbal hallucinations (AVH) are a key symptom of schizophrenia. Recent neuroimaging studies examining dynamic functional connectivity suggest that disrupted dynamic interactions between brain networks characterize complex symptoms in mental illness including schizophrenia. Studying dynamic connectivity may be especially relevant for hallucinations, given their fluctuating phenomenology. Indeed, it remains unknown whether AVH in schizophrenia are directly related to altered dynamic connectivity within and between key brain networks involved in auditory perception and language, emotion processing, and top-down control. In this study, we used dynamic connectivity approaches including sliding window and k-means to examine dynamic interactions among brain networks in schizophrenia patients with and without a recent history of AVH. Dynamic brain network analysis revealed that patients with AVH spent less time in a 'network-antagonistic' brain state where the default mode network (DMN) and the language network were anti-correlated, and had lower probability to switch into this brain state. Moreover, patients with AVH showed a lower connectivity within the language network and the auditory network, and lower connectivity was observed between the executive control and the language networks in certain dynamic states. Our study provides the first neuroimaging evidence of altered dynamic brain networks for understanding neural mechanisms of AVH in schizophrenia. The findings may inform and further strengthen cognitive models of AVH that aid the development of new coping strategies for patients.

| S-EPMC7544708 | biostudies-literature

Network analysis reveals rare disease signatures across multiple levels of biological organization

Project description:Rare genetic diseases are typically caused by a single gene defect. Despite this clear causal relationship between genotype and phenotype, identifying the pathobiological mechanisms at various levels of biological organization remains a practical and conceptual challenge. Here, we introduce a network approach for evaluating the impact of rare gene defects across biological scales. We construct a multiplex network consisting of over 20 million gene relationships that are organized into 46 network layers spanning six major biological scales between genotype and phenotype. A comprehensive analysis of 3,771 rare diseases reveals distinct phenotypic modules within individual layers. These modules can be exploited to mechanistically dissect the impact of gene defects and accurately predict rare disease gene candidates. Our results show that the disease module formalism can be applied to rare diseases and generalized beyond physical interaction networks. These findings open up new venues to apply network-based tools for cross-scale data integration. Despite the clear causal relationship between genotype and phenotype in rare diseases, identifying the pathobiological mechanisms at various levels of biological organization remains a practical and conceptual challenge. Here, the authors introduce a network approach for evaluating the impact of rare gene defects across biological scales.

| S-EPMC8578255 | biostudies-literature

Full-scale network analysis reveals properties of the FV protein structure organization.

Project description:Blood coagulation is a vital process for humans and other species. Following an injury to a blood vessel, a cascade of molecular signals is transmitted, inhibiting and activating more than a dozen coagulation factors and resulting in the formation of a fibrin clot that ceases the bleeding. In this process, the Coagulation factor V (FV) is a master regulator, coordinating critical steps of this process. Mutations to this factor result in spontaneous bleeding episodes and prolonged hemorrhage after trauma or surgery. Although the role of FV is well characterized, it is unclear how single-point mutations affect its structure. In this study, to understand the effect of mutations, we created a detailed network map of this protein, where each node is a residue, and two residues are connected if they are in close proximity in the three-dimensional structure. Overall, we analyzed 63 point-mutations from patients and identified common patterns underlying FV deficient phenotypes. We used structural and evolutionary patterns as input to machine learning algorithms to anticipate the effects of mutations and anticipated FV-deficiency with fair accuracy. Together, our results demonstrate how clinical features, genetic data and in silico analysis are converging to enhance treatment and diagnosis of coagulation disorders.

| S-EPMC10260930 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data