An evolving model of undirected networks based on microscopic biological interaction systems.
Ontology highlight
ABSTRACT:
SUBMITTER: Tan L
PROVIDER: S-EPMC2669123 | biostudies-other | 2009 May
REPOSITORIES: biostudies-other
Similar Datasets
Project description:It has been a challenge to understand the formation and roles of social groups or natural communities in the evolution of species, societies and real world networks. Here, we propose the hypothesis that homophyly/kinship is the intrinsic mechanism of natural communities, introduce the notion of the affinity exponent and propose the homophyly/kinship model of networks. We demonstrate that the networks of our model satisfy a number of topological, probabilistic and combinatorial properties and, in particular, that the robustness and stability of natural communities increase as the affinity exponent increases and that the reciprocity of the networks in our model decreases as the affinity exponent increases. We show that both homophyly/kinship and reciprocity are essential to the emergence of cooperation in evolutionary games and that the homophyly/kinship and reciprocity determined by the appropriate affinity exponent guarantee the emergence of cooperation in evolutionary games, verifying Darwin's proposal that kinship and reciprocity are the means of individual fitness. We propose the new principle of structure entropy minimisation for detecting natural communities of networks and verify the functional module property and characteristic properties by a healthy tissue cell network, a citation network, some metabolic networks and a protein interaction network.
| S-EPMC4609949 | biostudies-literature
Project description:Dynamic networks are a general language for describing time-evolving complex systems, and discrete time network models provide an emerging statistical technique for various applications. It is a fundamental research question to detect a set of nodes sharing similar connectivity patterns in time-evolving networks. Our work is primarily motivated by detecting groups based on interesting features of the time-evolving networks (e.g., stability). In this work, we propose a model-based clustering framework for time-evolving networks based on discrete time exponential-family random graph models, which simultaneously allows both modeling and detecting group structure. To choose the number of groups, we use the conditional likelihood to construct an effective model selection criterion. Furthermore, we propose an efficient variational expectation-maximization (EM) algorithm to find approximate maximum likelihood estimates of network parameters and mixing proportions. The power of our method is demonstrated in simulation studies and empirical applications to international trade networks and the collaboration networks of a large research university.
| S-EPMC7448400 | biostudies-literature
Project description:BackgroundStudy of drug-target interaction networks is an important topic for drug development. It is both time-consuming and costly to determine compound-protein interactions or potential drug-target interactions by experiments alone. As a complement, the in silico prediction methods can provide us with very useful information in a timely manner.Methods/principal findingsTo realize this, drug compounds are encoded with functional groups and proteins encoded by biological features including biochemical and physicochemical properties. The optimal feature selection procedures are adopted by means of the mRMR (Maximum Relevance Minimum Redundancy) method. Instead of classifying the proteins as a whole family, target proteins are divided into four groups: enzymes, ion channels, G-protein- coupled receptors and nuclear receptors. Thus, four independent predictors are established using the Nearest Neighbor algorithm as their operation engine, with each to predict the interactions between drugs and one of the four protein groups. As a result, the overall success rates by the jackknife cross-validation tests achieved with the four predictors are 85.48%, 80.78%, 78.49%, and 85.66%, respectively.Conclusion/significanceOur results indicate that the network prediction system thus established is quite promising and encouraging.
| S-EPMC2836373 | biostudies-literature
Project description:BackgroundA goal of systems biology is to analyze large-scale molecular networks including gene expressions and protein-protein interactions, revealing the relationships between network structures and their biological functions. Dividing a protein-protein interaction (PPI) network into naturally grouped parts is an essential way to investigate the relationship between topology of networks and their functions. However, clear modular decomposition is often hard due to the heterogeneous or scale-free properties of PPI networks.Methodology/principal findingsTo address this problem, we propose a diffusion model-based spectral clustering algorithm, which analytically solves the cluster structure of PPI networks as a problem of random walks in the diffusion process in them. To cope with the heterogeneity of the networks, the power factor is introduced to adjust the diffusion matrix by weighting the transition (adjacency) matrix according to a node degree matrix. This algorithm is named adjustable diffusion matrix-based spectral clustering (ADMSC). To demonstrate the feasibility of ADMSC, we apply it to decomposition of a yeast PPI network, identifying biologically significant clusters with approximately equal size. Compared with other established algorithms, ADMSC facilitates clear and fast decomposition of PPI networks.Conclusions/significanceADMSC is proposed by introducing the power factor that adjusts the diffusion matrix to the heterogeneity of the PPI networks. ADMSC effectively partitions PPI networks into biologically significant clusters with almost equal sizes, while being very fast, robust and appealing simple.
| S-EPMC2935381 | biostudies-literature
Project description:Skeletal muscle function depends on the efficient coordination among subcellular systems. These systems are composed of proteins encoded by a subset of genes, all of which are tightly regulated. In the cases where regulation is altered because of disease or injury, dysfunction occurs. To enable objective analysis of muscle gene expression profiles, we have defined nine biological networks whose coordination is critical to muscle function. We begin by describing the expression of proteins necessary for optimal neuromuscular junction function that results in the muscle cell action potential. That action potential is transmitted to proteins involved in excitation-contraction coupling enabling Ca(2+) release. Ca(2+) then activates contractile proteins supporting actin and myosin cross-bridge cycling. Force generated by cross-bridges is transmitted via cytoskeletal proteins through the sarcolemma and out to critical proteins that support the muscle extracellular matrix. Muscle contraction is fueled through many proteins that regulate energy metabolism. Inflammation is a common response to injury that can result in alteration of many pathways within muscle. Muscle also has multiple pathways that regulate size through atrophy or hypertrophy. Finally, the isoforms associated with fast muscle fibers and their corresponding isoforms in slow muscle fibers are delineated. These nine networks represent important biological systems that affect skeletal muscle function. Combining high-throughput systems analysis with advanced networking software will allow researchers to use these networks to objectively study skeletal muscle systems.
| S-EPMC4076960 | biostudies-literature
Project description:four biological sludge systems Raw sequence reads
| PRJNA532830 | ENA
Project description:Genome-wide association studies have identified multiple genetic risk factors underlying susceptibility to substance use, however, the functional genes and biological mechanisms remain poorly understood. The discovery and characterization of risk genes can be facilitated by the integration of genome-wide association data and gene expression data across biologically relevant tissues and/or cell types to identify genes whose expression is altered by DNA sequence variation (expression quantitative trait loci; eQTLs). The integration of gene expression data can be extended to the study of genetic co-expression, under the biologically valid assumption that genes form co-expression networks to influence the manifestation of a disease or trait. Here, we integrate genome-wide association data with gene expression data from 13 brain tissues to identify candidate risk genes for 8 substance use phenotypes. We then test for the enrichment of candidate risk genes within tissue-specific gene co-expression networks to identify modules (or groups) of functionally related genes whose dysregulation is associated with variation in substance use. We identified eight gene modules in brain that were enriched with gene-based association signals for substance use phenotypes. For example, a single module of 40 co-expressed genes was enriched with gene-based associations for drinks per week and biological pathways involved in GABA synthesis, release, reuptake and degradation. Our study demonstrates the utility of eQTL and gene co-expression analysis to uncover novel biological mechanisms for substance use traits.
| S-EPMC8137546 | biostudies-literature
Project description:Link prediction aims to uncover the underlying relationship behind networks, which could be utilized to predict missing edges or identify the spurious edges. The key issue of link prediction is to estimate the likelihood of potential links in networks. Most classical static-structure based methods ignore the temporal aspects of networks, limited by the time-varying features, such approaches perform poorly in evolving networks. In this paper, we propose a hypothesis that the ability of each node to attract links depends not only on its structural importance, but also on its current popularity (activeness), since active nodes have much more probability to attract future links. Then a novel approach named popularity based structural perturbation method (PBSPM) and its fast algorithm are proposed to characterize the likelihood of an edge from both existing connectivity structure and current popularity of its two endpoints. Experiments on six evolving networks show that the proposed methods outperform state-of-the-art methods in accuracy and robustness. Besides, visual results and statistical analysis reveal that the proposed methods are inclined to predict future edges between active nodes, rather than edges between inactive nodes.
| S-EPMC5540936 | biostudies-other
Project description:Orthologous genes are highly conserved between closely related species and biological systems often utilize the same genes across different organisms. However, while sequence similarity often implies functional similarity, interaction data is not well conserved even for proteins with high sequence similarity. Several recent studies comparing high throughput data including expression, protein-protein, protein-DNA, and genetic interactions between close species show conservation at a much lower rate than expected.In this work we collected comprehensive high-throughput interaction datasets for four model organisms (S. cerevisiae, S. pombe, C. elegans, and D. melanogaster) and carried out systematic analyses in order to explain the apparent lower conservation of interaction data when compared to the conservation of sequence data. We first showed that several previously proposed hypotheses only provide a limited explanation for such lower conservation rates. We combined all interaction evidences into an integrated network for each species and identified functional modules from these integrated networks. We then demonstrate that interactions that are part of functional modules are conserved at much higher rates than previous reports in the literature, while interactions that connect between distinct functional modules are conserved at lower rates.We show that conservation is maintained between species, but mainly at the module level. Our results indicate that interactions within modules are much more likely to be conserved than interactions between proteins in different modules. This provides a network based explanation to the observed conservation rates that can also help explain why so many biological processes are well conserved despite the lower levels of conservation for the interactions of proteins participating in these processes.Accompanying website: http://www.sb.cs.cmu.edu/CrossSP.
| S-EPMC3212960 | biostudies-literature
Project description:"It is hard to realize that the living world as we know it is just one among many possibilities" [1]. Evolving digital ecological networks are webs of interacting, self-replicating, and evolving computer programs (i.e., digital organisms) that experience the same major ecological interactions as biological organisms (e.g., competition, predation, parasitism, and mutualism). Despite being computational, these programs evolve quickly in an open-ended way, and starting from only one or two ancestral organisms, the formation of ecological networks can be observed in real-time by tracking interactions between the constantly evolving organism phenotypes. These phenotypes may be defined by combinations of logical computations (hereafter tasks) that digital organisms perform and by expressed behaviors that have evolved. The types and outcomes of interactions between phenotypes are determined by task overlap for logic-defined phenotypes and by responses to encounters in the case of behavioral phenotypes. Biologists use these evolving networks to study active and fundamental topics within evolutionary ecology (e.g., the extent to which the architecture of multispecies networks shape coevolutionary outcomes, and the processes involved).
| S-EPMC3605903 | biostudies-other