A trade-off between sample complexity and computational complexity in learning Boolean networks from time-series data.
A key problem in molecular biology is to infer regulatory relationships between genes from expression data. This paper studies a simplified model of such inference problems in which one or more Boolean variables, modeling, for example, the expression levels of genes, each depend deterministically on a small but unknown subset of a large number of Boolean input variables. Our model assumes that the expression data comprises a time series, in which successive samples may be correlated. We provide bounds on the expected amount of data needed to infer the correct relationships between output and input variables. These bounds improve and generalize previous results for Boolean network inference and continuous-time switching network inference. Although the computational problem is intractable in general, we describe a fixed-parameter tractable algorithm that is guaranteed to provide at least a partial solution to the problem. Most interestingly, both the sample complexity and computational complexity of the problem depend on the strength of correlations between successive samples in the time series but in opposing ways. Uncorrelated samples minimize the total number of samples needed while maximizing computational complexity; a strong correlation between successive samples has the opposite effect. This observation has implications for the design of experiments for measuring gene expression.
McGill University, 3480 University St., Montreal, Quebec, Canada. tperkins@ohri.ca
Theodore J
TJ
Perkins
Michael T
MT
Hallett
D000465:Algorithms; D001185:Artificial Intelligence; D003198:Computer Simulation; D020869:Gene Expression Profiling / Q000379:methods*; D016015:Logistic Models; D008954:Models, Biological; D020543:Proteome / Q000378:metabolism*; D012815:Signal Processing, Computer-Assisted; D015398:Signal Transduction / Q000502:physiology*; D013997:Time Factors
D020543:Proteome