# zbMATH — the first resource for mathematics

##### Examples
 Geometry Search for the term Geometry in any field. Queries are case-independent. Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact. "Topological group" Phrases (multi-words) should be set in "straight quotation marks". au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted. Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff. "Quasi* map*" py: 1989 The resulting documents have publication year 1989. so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14. "Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic. dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles. py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses). la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

##### Operators
 a & b logic and a | b logic or !ab logic not abc* right wildcard "ab c" phrase (ab c) parentheses
##### Fields
 any anywhere an internal document identifier au author, editor ai internal author identifier ti title la language so source ab review, abstract py publication year rv reviewer cc MSC code ut uncontrolled term dt document type (j: journal article; b: book; a: book article)
Temporal Boolean network models of genetic networks and their inference from gene expression time series. (English) Zbl 1167.92335

Summary: Identification of genetic regulatory networks and genetic signal transduction pathways from gene expression data is one of the key problems in computational molecular biology. Boolean networks offer a discrete time Boolean model of gene expression. In this model, each gene can be in one of two states (on or off) at any given time, and the expression of a given gene at time $t+1$ can be modeled by a Boolean function of the expression of at most $k$ genes at time $t$. Typically $k\ll n$, where $n$ is the total number of genes under consideration.

This paper motivates and introduces a generalization of the Boolean network model to address dependencies among activity of genes that span for more than one unit of time. The resulting model, called the temporal Boolean network or the $\text{TBN}\left(n,k,T\right)$ model, allows the expression of each gene to be controlled by a Boolean function of the expression levels of at most $k$ genes at times in $t\cdots T-1$. We apply an adaptation of a popular machine learning algorithm for decision tree induction for inference of a $\text{TBN}\left(n,k,T\right)$ network from artificially generated gene expression data. Preliminary experiments with synthetic gene expression data generated from known $\text{TBN}\left(n,k,T\right)$ networks demonstrate the feasibility of this approach. We conclude with a discussion of some of the limitations of the proposed approach and some directions for further research.

##### MSC:
 92D10 Genetics 92C40 Biochemistry, molecular biology