Constructing a Knowledge Base for Gene Regulatory Dynamics by Formal Concept Analysis Methods
University of Technology(德累斯顿工业大学);Leibniz Institute for Natural Product Research and Infection Biology - Hans-Knöll-Institute (HKI)(莱布尼茨天然产物研究与感染生物学研究所——汉斯·克诺尔研究所(HKI))
Johannes Wollbold, Reinhard Guthke, Bernhard Ganter
备注:
15 pages, 1 figure, LaTeX style llncsdoc.sty
发表信息:
K. Horimoto et al. (Eds.): AB 2008, LNCS 5147. Springer, Heidelberg 2008, pp. 230-244
Our aim is to build a set of rules, such that reasoning over temporal dependencies within gene regulatory networks is possible. The underlying transitions may be obtained by discretizing observed time series, or they are generated based on existing knowledge, e.g. by Boolean networks or their nondeterministic generalization. We use the mathematical discipline of formal concept analysis (FCA), which has been applied successfully in domains as knowledge representation, data mining or software engineering. By the attribute exploration algorithm, an expert or a supporting computer program is enabled to decide about the validity of a minimal set of implications and thus to construct a sound and complete knowledge base. From this all valid implications are derivable that relate to the selected properties of a set of genes. We present results of our method for the initiation of sporulation in Bacillus subtilis. However the formal structures are exhibited in a most general manner. Therefore the approach may be adapted to signal transduction or metabolic networks, as well as to discrete temporal transitions in many biological and nonbiological areas.
Predictive-Switching Control of Stochastic Gene Regulatory Networks: A Contractive PIDE Framework
Institute for Integrative Systems Biology, Spanish National Research Council(整合系统生物学研究所,西班牙国家研究委员会);Universidade de Vigo(维戈大学);ELKH Institute for Computer Science and Control (SZTAKI)(匈牙利科学院计算机与控制研究所(SZTAKI))
Biological systems and processes are networks of complex nonlinear regulatory interactions between nucleic acids, proteins, and metabolites. A natural way in which to represent these interaction networks is through the use of a graph. In this formulation, each node represents a nucleic acid, protein, or metabolite and edges represent intermolecular interactions (inhibition, regulation, promotion, coexpression, etc.). In this work, a novel algorithm for the discovery of latent graph structures given experimental data is presented.
Identification of genes that initiate cell anomalies and cause cancer in humans is among the important fields in the oncology researches. The mutation and development of anomalies in these genes are then transferred to other genes in the cell and therefore disrupt the normal functionality of the cell. These genes are known as cancer driver genes (CDGs). Various methods have been proposed for predicting CDGs, most of which based on genomic data and based on computational methods. Therefore, some researchers have developed novel bioinformatics approaches. In this study, we propose an algorithm, …
Developing and maintaining life requires a lot of computation. This is done by gene regulatory networks. But we have little understanding of how this computation is organized. I show that there is a direct correspondence between the structural and functional building blocks of regulatory networks, which I call regulatory motifs. I derive a simple bound on the range of function that these motifs can perform, in terms of the local network structure. I prove that this range is a small fraction of all possible functions, which severely constrains global network behavior. Part of this restriction i…
Inference of gene regulatory networks has been an active area of research for around 20 years, leading to the development of sophisticated inference algorithms based on a variety of assumptions and approaches. With the always increasing demand for more accurate and powerful models, the inference problem remains of broad scientific interest. The abstract representation of biological systems through gene regulatory networks represents a powerful method to study such systems, encoding different amounts and types of information. In this review, we summarize the different types of inference algorit…
Background:Gene regulations often change over time rather than being constant. But many of gene regulatory networks extracted from databases are static. The tumor suppressor gene $P53$ is involved in the pathogenesis of many tumors, and its inhibition effects occur after a certain period. Therefore, it is of great significance to elucidate the regulation mechanism over time points. Result:A qualitative method for representing dynamic gene regulatory network is developed, called CdtGRN. It adopts the combination of convolutional neural networks(CNN) and fully connected networks(DNN) as the core…
SIREN Cytoscape plugin: Interaction Type Discrimination in Gene Regulatory Networks
将表达数据与网络中的基因相互作用相结合对于理解细胞的功能组织至关重要。因此,在生物网络中的相互作用类型的知识是重要的数据解释。Signing of Regulatory Networks(SIREN)plugin for Cytoscape是一个开源Java工具,用于区分基因调控网络中的相互作用类型(激活或抑制)。SIREN利用基于信息论的概念,试图通过检查它们相应的基因表达谱来识别基因对的相互作用类型。我们介绍SIREN,一个快速和内存高效的工具,具有低计算复杂度,使用户可以很容易地将其视为许多网络重建方法的补充方法。SIREN允许生物学家使用独立的表达数据来预测已知基因调控网络的相互作用类型,其中重建方法不提供关于其相互作用类型的性质的任何信息。SIREN Cytoscape插件是用Java实现的,可以在http://baderlab.org/Software/SIRENplugin和Cytoscape应用程序管理器上免费获得。
Regulatory networks describe the interactions between molecular or cellular regulators, like transcription factors and genes in gene regulatory networks, kinases and their receptors in signalling networks, or neurons in neural networks. A long-standing aim of quantitative biology is to reconstruct such networks on the basis of large-scale data. Our aim is to leverage fluctuations around the non-equilibrium steady state for network inference. To this end, we use a stochastic model of gene regulation or neural dynamics and solve it approximately within a Gaussian mean-field theory. We develop a …
University of Cambridge(剑桥大学);Computer Laboratory(计算机实验室)
Delays in protein synthesis cause a confounding effect when constructing Gene Regulatory Networks (GRNs) from RNA-sequencing time-series data. Accurate GRNs can be very insightful when modelling development, disease pathways, and drug side-effects. We present a model which incorporates translation delays by combining mechanistic equations and Bayesian approaches to fit to experimental data. This enables greater biological interpretability, and the use of Gaussian processes enables non-linear expressivity through kernels as well as naturally accounting for biological variation.
Modeling Dynamics, Cell Type Specificity, and Perturbations in Gene Regulatory Networks
Wisconsin Institute for Discovery, University of Wisconsin-Madison(威斯康星发现研究所,威斯康星大学麦迪逊分校);Department of Biostatistics and Medical Informatics, University of Wisconsin-Madison(威斯康星大学麦迪逊分校生物统计与医学信息学系)
In this paper, we conduct theoretical analyses on inferring the structure of gene regulatory networks. Depending on the experimental method and data type, the inference problem is classified into 20 different scenarios. For each scenario, we discuss the problem that with enough data, under what assumptions, what can be inferred about the structure. For scenarios that have been covered in the literature, we provide a brief review. For scenarios that have not been covered in literature, if the structure can be inferred, we propose new mathematical inference methods and evaluate them on simulated…
The influence of decay in dynamic models of gene regulatory networks
Kyiv-Mohyla Academy(基辅莫希拉学院);Institute of Mathematics, NAS of Ukraine(乌克兰国家科学院数学研究所);Institute of Mathematics and Computer Science, University of Latvia(拉脱维亚大学数学与计算机科学研究所);Daugavpils University(道加夫皮尔斯大学)