首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 78 毫秒
1.
Polyploidy or whole-genome duplication is a frequent phenomenon within the plant kingdom and has been associated with the occurrence of evolutionary novelty and increase in biological complexity. Because genome-wide duplication events duplicate whole molecular networks it is of interest to investigate how these networks evolve subsequent to such events. Although genome duplications are generally followed by massive gene loss, at least part of the network is usually retained in duplicate and can rewire to execute novel functions. Alternatively, the network can remain largely redundant and as such confer robustness against mutations. The increasing availability of high-throughput data makes it possible to study evolution following whole genome duplication events at the network level. Here we discuss how the use of 'omics' data in network analysis can provide novel insights on network redundancy and rewiring and conclude with some directions for future research.  相似文献   

2.
The analysis of network evolution has been hampered by limited availability of protein interaction data for different organisms. In this study, we investigate evolutionary mechanisms in Src Homology 3 (SH3) domain and kinase interaction networks using high-resolution specificity profiles. We constructed and examined networks for 23 fungal species ranging from Saccharomyces cerevisiae to Schizosaccharomyces pombe. We quantify rates of different rewiring mechanisms and show that interaction change through binding site evolution is faster than through gene gain or loss. We found that SH3 interactions evolve swiftly, at rates similar to those found in phosphoregulation evolution. Importantly, we show that interaction changes are sufficiently rapid to exhibit saturation phenomena at the observed timescales. Finally, focusing on the SH3 interaction network, we observe extensive clustering of binding sites on target proteins by SH3 domains and a strong correlation between the number of domains that bind a target protein (target in-degree) and interaction conservation. The relationship between in-degree and interaction conservation is driven by two different effects, namely the number of clusters that correspond to interaction interfaces and the number of domains that bind to each cluster leads to sequence specific conservation, which in turn results in interaction conservation. In summary, we uncover several network evolution mechanisms likely to generalize across peptide recognition modules.  相似文献   

3.
4.
Zhang C  Zhang J  Weissing FJ  Perc M  Xie G  Wang L 《PloS one》2012,7(4):e35183
In social dilemmas, cooperation among randomly interacting individuals is often difficult to achieve. The situation changes if interactions take place in a network where the network structure jointly evolves with the behavioral strategies of the interacting individuals. In particular, cooperation can be stabilized if individuals tend to cut interaction links when facing adverse neighborhoods. Here we consider two different types of reaction to adverse neighborhoods, and all possible mixtures between these reactions. When faced with a gloomy outlook, players can either choose to cut and rewire some of their links to other individuals, or they can migrate to another location and establish new links in the new local neighborhood. We find that in general local rewiring is more favorable for the evolution of cooperation than emigration from adverse neighborhoods. Rewiring helps to maintain the diversity in the degree distribution of players and favors the spontaneous emergence of cooperative clusters. Both properties are known to favor the evolution of cooperation on networks. Interestingly, a mixture of migration and rewiring is even more favorable for the evolution of cooperation than rewiring on its own. While most models only consider a single type of reaction to adverse neighborhoods, the coexistence of several such reactions may actually be an optimal setting for the evolution of cooperation.  相似文献   

5.

Background

Understanding the evolution of biological networks can provide insight into how their modular structure arises and how they are affected by environmental changes. One approach to studying the evolution of these networks is to reconstruct plausible common ancestors of present-day networks, allowing us to analyze how the topological properties change over time and to posit mechanisms that drive the networks?? evolution. Further, putative ancestral networks can be used to help solve other difficult problems in computational biology, such as network alignment.

Results

We introduce a combinatorial framework for encoding network histories, and we give a fast procedure that, given a set of gene duplication histories, in practice finds network histories with close to the minimum number of interaction gain or loss events to explain the observed present-day networks. In contrast to previous studies, our method does not require knowing the relative ordering of unrelated duplication events. Results on simulated histories and real biological networks both suggest that common ancestral networks can be accurately reconstructed using this parsimony approach. A software package implementing our method is available under the Apache 2.0 license at http://cbcb.umd.edu/kingsford-group/parana.

Conclusions

Our parsimony-based approach to ancestral network reconstruction is both efficient and accurate. We show that considering a larger set of potential ancestral interactions by not assuming a relative ordering of unrelated duplication events can lead to improved ancestral network inference.  相似文献   

6.
Kim J  Kim I  Yang JS  Shin YE  Hwang J  Park S  Choi YS  Kim S 《PLoS genetics》2012,8(2):e1002510
PDZ domain-mediated interactions have greatly expanded during metazoan evolution, becoming important for controlling signal flow via the assembly of multiple signaling components. The evolutionary history of PDZ domain-mediated interactions has never been explored at the molecular level. It is of great interest to understand how PDZ domain-ligand interactions emerged and how they become rewired during evolution. Here, we constructed the first human PDZ domain-ligand interaction network (PDZNet) together with binding motif sequences and interaction strengths of ligands. PDZNet includes 1,213 interactions between 97 human PDZ proteins and 591 ligands that connect most PDZ protein-mediated interactions (98%) in a large single network via shared ligands. We examined the rewiring of PDZ domain-ligand interactions throughout eukaryotic evolution by tracing changes in the C-terminal binding motif sequences of the PDZ ligands. We found that interaction rewiring by sequence mutation frequently occurred throughout evolution, largely contributing to the growth of PDZNet. The rewiring of PDZ domain-ligand interactions provided an effective means of functional innovations in nervous system development. Our findings provide empirical evidence for a network evolution model that highlights the rewiring of interactions as a mechanism for the development of new protein functions. PDZNet will be a valuable resource to further characterize the organization of the PDZ domain-mediated signaling proteome.  相似文献   

7.
8.
A useful approach to complex regulatory networks consists of modeling their elements and interactions by Boolean equations. In this context, feedback circuits (i.e. circular sequences of interactions) have been shown to play key dynamical roles: whereas positive circuits are able to generate multistationarity, negative circuits may generate oscillatory behavior. In this paper, we principally focus on the case of gene networks. These are represented by fully connected Boolean networks where each element interacts with all elements including itself. Flexibility in network design is introduced by the use of Boolean parameters, one associated with each interaction or group of interactions affecting a given element. Within this formalism, a feedback circuit will generate its typical dynamical behavior (i.e. multistationarity or oscillations) only for appropriate values of some of the logical parameters. Whenever it does, we say that the circuit is 'functional'. More interestingly, this formalism allows the computation of the constraints on the logical parameters to have any feedback circuit functional in a network. Using this methodology, we found that the fraction of the total number of consistent combinations of parameter values that make a circuit functional decreases geometrically with the circuit length. From a biological point of view, this suggests that regulatory networks could be decomposed into small and relatively independent feedback circuits or 'regulatory modules'.  相似文献   

9.
10.
Complex regulatory networks orchestrate most cellular processes in biological systems. Genes in such networks are subject to expression noise, resulting in isogenic cell populations exhibiting cell-to-cell variation in protein levels. Increasing evidence suggests that cells have evolved regulatory strategies to limit, tolerate or amplify expression noise. In this context, fundamental questions arise: how can the architecture of gene regulatory networks generate, make use of or be constrained by expression noise? Here, we discuss the interplay between expression noise and gene regulatory network at different levels of organization, ranging from a single regulatory interaction to entire regulatory networks. We then consider how this interplay impacts a variety of phenomena, such as pathogenicity, disease, adaptation to changing environments, differential cell-fate outcome and incomplete or partial penetrance effects. Finally, we highlight recent technological developments that permit measurements at the single-cell level, and discuss directions for future research.  相似文献   

11.
We consider previously proposed procedures for generating clustered networks and investigate how these procedures lead to differences in network properties other than clustering. We interpret our findings in terms of the effect of the network structure on the disease outbreak threshold and disease dynamics. To generate null-model networks for comparison, we implement an assortativity-conserving rewiring algorithm that alters the level of clustering while causing minimal impact on other properties. We show that many theoretical network models used to generate networks with a particular property often lead to significant changes in network properties other than that of interest. For high levels of clustering, different procedures lead to networks that differ in degree heterogeneity and assortativity, and in broader scale measures such as ?(0) and the distribution of shortest path lengths. Hence, care must be taken when investigating the implications of network properties for disease transmission or other dynamic process that the network supports.  相似文献   

12.
13.
14.
Blonder B  Dornhaus A 《PloS one》2011,6(5):e20298

Background

An important function of many complex networks is to inhibit or promote the transmission of disease, resources, or information between individuals. However, little is known about how the temporal dynamics of individual-level interactions affect these networks and constrain their function. Ant colonies are a model comparative system for understanding general principles linking individual-level interactions to network-level functions because interactions among individuals enable integration of multiple sources of information to collectively make decisions, and allocate tasks and resources.

Methodology/Findings

Here we show how the temporal and spatial dynamics of such individual interactions provide upper bounds to rates of colony-level information flow in the ant Temnothorax rugatulus. We develop a general framework for analyzing dynamic networks and a mathematical model that predicts how information flow scales with individual mobility and group size.

Conclusions/Significance

Using thousands of time-stamped interactions between uniquely marked ants in four colonies of a range of sizes, we demonstrate that observed maximum rates of information flow are always slower than predicted, and are constrained by regulation of individual mobility and contact rate. By accounting for the ordering and timing of interactions, we can resolve important difficulties with network sampling frequency and duration, enabling a broader understanding of interaction network functioning across systems and scales.  相似文献   

15.
16.
17.
18.
19.
20.
Enviro–climatic changes are thought to be causing alterations in ecosystem processes through shifts in plant and microbial communities; however, how links between plant and microbial communities change with enviro–climatic change is likely to be less straightforward but may be fundamental for many ecological processes. To address this, we assessed the composition of the plant community and the prokaryotic community – using amplicon-based sequencing – of three European peatlands that were distinct in enviro–climatic conditions. Bipartite networks were used to construct site-specific plant–prokaryote co-occurrence networks. Our data show that between sites, plant and prokaryotic communities differ and that turnover in interactions between the communities was complex. Essentially, turnover in plant–microbial interactions is much faster than turnover in the respective communities. Our findings suggest that network rewiring does largely result from novel or different interactions between species common to all realised networks. Hence, turnover in network composition is largely driven by the establishment of new interactions between a core community of plants and microorganisms that are shared among all sites. Taken together our results indicate that plant–microbe associations are context dependent, and that changes in enviro–climatic conditions will likely lead to network rewiring. Integrating turnover in plant–microbe interactions into studies that assess the impact of enviro–climatic change on peatland ecosystems is essential to understand ecosystem dynamics and must be combined with studies on the impact of these changes on ecosystem processes.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号