2010
DOI: 10.1093/bioinformatics/btq120
|View full text |Cite
|
Sign up to set email alerts
|

Identification of genetic network dynamics with unate structure

Abstract: We propose a differential equation modelling framework where the regulatory interactions among genes are expressed in terms of unate functions, a class of gene activation rules commonly encountered in Boolean network modelling. We establish analytical properties of the models in the class and exploit them to devise a two-step procedure for gene network reconstruction from product concentration and synthesis rate time series. The first step isolates a family of model structures compatible with the data from a s… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
66
0

Year Published

2010
2010
2016
2016

Publication Types

Select...
4
2
1

Relationship

2
5

Authors

Journals

citations
Cited by 28 publications
(66 citation statements)
references
References 32 publications
0
66
0
Order By: Relevance
“…This first stage is very similar to our approach, in the sense that it separates the issues of network topology and the functional/parametric representation of the dynamics. However, our approach differs from the one in [17] in that, (i) we propose a discrete-time model structure that is directly derived from the time series data, (ii) we prove that the conditions that we use to reject some network topologies are both necessary and sufficient (see Theorem 4), while in [17], no such result is derived, (iii) we present some theoretical analysis on irrefutable models and data.…”
Section: Introductionmentioning
confidence: 94%
See 1 more Smart Citation
“…This first stage is very similar to our approach, in the sense that it separates the issues of network topology and the functional/parametric representation of the dynamics. However, our approach differs from the one in [17] in that, (i) we propose a discrete-time model structure that is directly derived from the time series data, (ii) we prove that the conditions that we use to reject some network topologies are both necessary and sufficient (see Theorem 4), while in [17], no such result is derived, (iii) we present some theoretical analysis on irrefutable models and data.…”
Section: Introductionmentioning
confidence: 94%
“…A recent work by Porreca et al, published earlier in [17], proposed a two-staged process in identifying a continuoustime differential equation model for GRNs. In the first stage, network topologies that are inconsistent with the data are rejected.…”
Section: Introductionmentioning
confidence: 99%
“…An approach that preserves the form of Boolean-like kinetic models, accounts for sigmoidal activation functions and avoids parsing all possible model structures was proposed in [1] (see also [16]). The method relies on the use of unate functions [17], a class of Boolean gene activation rules that appears to be a comprehensive description of the observable interactions among genes [18].…”
mentioning
confidence: 99%
“…In this paper we investigate the applicability of the identification algorithm [1] to the common situation where only protein concentration measurements are available over time. Based on the standard biological assumption that protein degradation rates are known, we introduce a preliminary step where the missing information is reconstructed from the available data.…”
mentioning
confidence: 99%
See 1 more Smart Citation