首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 0 毫秒
1.
2.
3.
Complex traits and other polygenic processes require coordinated gene expression. Co-expression networks model mRNA co-expression: the product of gene regulatory networks. To identify regulatory mechanisms underlying coordinated gene expression in a tissue-enriched context, ten Arabidopsis thaliana co-expression networks were constructed after manually sorting 4,566 RNA profiling datasets into aerial, flower, leaf, root, rosette, seedling, seed, shoot, whole plant, and global (all samples combined) groups. Collectively, the ten networks contained 30% of the measurable genes of Arabidopsis and were circumscribed into 5,491 modules. Modules were scrutinized for cis regulatory mechanisms putatively encoded in conserved non-coding sequences (CNSs) previously identified as remnants of a whole genome duplication event. We determined the non-random association of 1,361 unique CNSs to 1,904 co-expression network gene modules. Furthermore, the CNS elements were placed in the context of known gene regulatory networks (GRNs) by connecting 250 CNS motifs with known GRN cis elements. Our results provide support for a regulatory role of some CNS elements and suggest the functional consequences of CNS activation of co-expression in specific gene sets dispersed throughout the genome.  相似文献   

4.
5.
6.
7.
The journal Genomics Proteomics & Bioinformatics (GPB) is now inviting submissions for a special issue (to be published around Dec 2012) on the topic of Gene Regulatory Network. The Gene Regulatory Network (GRN) is a collection of DNA sequences which interact with each other and other cellular components, thereby governing the rates at which genes in the network are transcribed to change the genomic activity. GRNs are evolutionally-conserved and play critical roles in various biological processes and attract more and more research interest.  相似文献   

8.
The journal Genomics Proteomics & Bioinformatics(GPB) is now inviting submissions for a special issue(to be published around April 2013) on the topic of Gene Regulatory Network.  相似文献   

9.
10.
11.
The inference of gene regulatory network from expression data is an important area of research that provides insight to the inner workings of a biological system. The relevance-network-based approaches provide a simple and easily-scalable solution to the understanding of interaction between genes. Up until now, most works based on relevance network focus on the discovery of direct regulation using correlation coefficient or mutual information. However, some of the more complicated interactions such as interactive regulation and coregulation are not easily detected. In this work, we propose a relevance network model for gene regulatory network inference which employs both mutual information and conditional mutual information to determine the interactions between genes. For this purpose, we propose a conditional mutual information estimator based on adaptive partitioning which allows us to condition on both discrete and continuous random variables. We provide experimental results that demonstrate that the proposed regulatory network inference algorithm can provide better performance when the target network contains coregulated and interactively regulated genes.  相似文献   

12.
13.
Driven by the desire to understand genomic functions through the interactions among genes and gene products, the research in gene regulatory networks has become a heated area in genomic signal processing. Among the most studied mathematical models are Boolean networks and probabilistic Boolean networks, which are rule-based dynamic systems. This tutorial provides an introduction to the essential concepts of these two Boolean models, and presents the up-to-date analysis and simulation methods developed for them. In the Analysis section, we will show that Boolean models are Markov chains, based on which we present a Markovian steady-state analysis on attractors, and also reveal the relationship between probabilistic Boolean networks and dynamic Bayesian networks (another popular genetic network model), again via Markov analysis; we dedicate the last subsection to structural analysis, which opens a door to other topics such as network control. The Simulation section will start from the basic tasks of creating state transition diagrams and finding attractors, proceed to the simulation of network dynamics and obtaining the steady-state distributions, and finally come to an algorithm of generating artificial Boolean networks with prescribed attractors. The contents are arranged in a roughly logical order, such that the Markov chain analysis lays the basis for the most part of Analysis section, and also prepares the readers to the topics in Simulation section.  相似文献   

14.
15.
Physical interactions between proteins mediate a variety of biological functions, including signal transduction, physical structuring of the cell and regulation. While extensive catalogs of such interactions are known from model organisms, their evolutionary histories are difficult to study given the lack of interaction data from phylogenetic outgroups. Using phylogenomic approaches, we infer a upper bound on the time of origin for a large set of human protein-protein interactions, showing that most such interactions appear relatively ancient, dating no later than the radiation of placental mammals. By analyzing paired alignments of orthologous and putatively interacting protein-coding genes from eight mammals, we find evidence for weak but significant co-evolution, as measured by relative selective constraint, between pairs of genes with interacting proteins. However, we find no strong evidence for shared instances of directional selection within an interacting pair. Finally, we use a network approach to show that the distribution of selective constraint across the protein interaction network is non-random, with a clear tendency for interacting proteins to share similar selective constraints. Collectively, the results suggest that, on the whole, protein interactions in mammals are under selective constraint, presumably due to their functional roles.  相似文献   

16.
Elucidating gene regulatory network (GRN) from large scale experimental data remains a central challenge in systems biology. Recently, numerous techniques, particularly consensus driven approaches combining different algorithms, have become a potentially promising strategy to infer accurate GRNs. Here, we develop a novel consensus inference algorithm, TopkNet that can integrate multiple algorithms to infer GRNs. Comprehensive performance benchmarking on a cloud computing framework demonstrated that (i) a simple strategy to combine many algorithms does not always lead to performance improvement compared to the cost of consensus and (ii) TopkNet integrating only high-performance algorithms provide significant performance improvement compared to the best individual algorithms and community prediction. These results suggest that a priori determination of high-performance algorithms is a key to reconstruct an unknown regulatory network. Similarity among gene-expression datasets can be useful to determine potential optimal algorithms for reconstruction of unknown regulatory networks, i.e., if expression-data associated with known regulatory network is similar to that with unknown regulatory network, optimal algorithms determined for the known regulatory network can be repurposed to infer the unknown regulatory network. Based on this observation, we developed a quantitative measure of similarity among gene-expression datasets and demonstrated that, if similarity between the two expression datasets is high, TopkNet integrating algorithms that are optimal for known dataset perform well on the unknown dataset. The consensus framework, TopkNet, together with the similarity measure proposed in this study provides a powerful strategy towards harnessing the wisdom of the crowds in reconstruction of unknown regulatory networks.  相似文献   

17.
A major goal of contemporary studies of embryonic development is to understand large sets of regulatory changes that accompany the phenomenon of embryonic induction. The highly resolved sea urchin pregastrular endomesoderm–gene regulatory network (EM-GRN) provides a unique framework to study the global regulatory interactions underlying endomesoderm induction. Vegetal micromeres of the sea urchin embryo constitute a classic endomesoderm signaling center, whose potential to induce archenteron formation from presumptive ectoderm was demonstrated almost a century ago. In this work, we ectopically activate the primary mesenchyme cell–GRN (PMC-GRN) that operates in micromere progeny by misexpressing the micromere determinant Pmar1 and identify the responding EM-GRN that is induced in animal blastomeres. Using localized loss-of -function analyses in conjunction with expression of endo16, the molecular definition of micromere-dependent endomesoderm specification, we show that the TGFβ cytokine, ActivinB, is an essential component of this induction in blastomeres that emit this signal, as well as in cells that respond to it. We report that normal pregastrular endomesoderm specification requires activation of the Pmar1-inducible subset of the EM-GRN by the same cytokine, strongly suggesting that early micromere-mediated endomesoderm specification, which regulates timely gastrulation in the sea urchin embryo, is also ActivinB dependent. This study unexpectedly uncovers the existence of an additional uncharacterized micromere signal to endomesoderm progenitors, significantly revising existing models. In one of the first network-level characterizations of an intercellular inductive phenomenon, we describe an important in vivo model of the requirement of ActivinB signaling in the earliest steps of embryonic endomesoderm progenitor specification.  相似文献   

18.
19.
活细胞依赖其众多的转录调控模块来实现复杂的生物功能,识别转录调控模块对深入理解细胞的功能及其转录机制有着重要的意义。本文结合酵母基因表达数据和ChIP-chip数据,提出了一种转录调控模块识别算法。该算法通过采用不同的P值阈值分别得到了核心集和粗糙集,然后对核心集和粗糙集进行判别,最后对基因进行扩展之后得到基因转录调控模块。将该算法运用到两个酵母基因表达数据中,得到了一些具有显著生物学意义的基因转录调控模块。与其它算法相比,该算法不仅可以识别含有较多基因的转录调控模块,而且可以识别一些其它算法不能识别的基因转录调控模块。识别得到的基因转录调控模块有着不同的生物学功能,并且有助于进一步理解酵母的转录调控机制。  相似文献   

20.
Various environmental signals integrate into a network of floral regulatory genes leading to the final decision on when to flower. Although a wealth of qualitative knowledge is available on how flowering time genes regulate each other, only a few studies incorporated this knowledge into predictive models. Such models are invaluable as they enable to investigate how various types of inputs are combined to give a quantitative readout. To investigate the effect of gene expression disturbances on flowering time, we developed a dynamic model for the regulation of flowering time in Arabidopsis thaliana. Model parameters were estimated based on expression time-courses for relevant genes, and a consistent set of flowering times for plants of various genetic backgrounds. Validation was performed by predicting changes in expression level in mutant backgrounds and comparing these predictions with independent expression data, and by comparison of predicted and experimental flowering times for several double mutants. Remarkably, the model predicts that a disturbance in a particular gene has not necessarily the largest impact on directly connected genes. For example, the model predicts that SUPPRESSOR OF OVEREXPRESSION OF CONSTANS (SOC1) mutation has a larger impact on APETALA1 (AP1), which is not directly regulated by SOC1, compared to its effect on LEAFY (LFY) which is under direct control of SOC1. This was confirmed by expression data. Another model prediction involves the importance of cooperativity in the regulation of APETALA1 (AP1) by LFY, a prediction supported by experimental evidence. Concluding, our model for flowering time gene regulation enables to address how different quantitative inputs are combined into one quantitative output, flowering time.  相似文献   

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

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