Inferring Broad Regulatory Biology from Time Course Data: Have We Reached an Upper Bound under Constraints Typical of In Vivo Studies?

Inferring Broad Regulatory Biology from Time Course Data: Have We Reached an Upper Bound under Constraints Typical of In Vivo Studies?
复制标题

DOI:
10.1371/journal.pone.0127364
复制
发表时间:
2015
期刊:
影响因子:
3.7
通讯作者:
Klimas NG
Klimas NG
中科院分区:
综合性期刊3区
文献类型:
--
作者:
Vashishtha S;Broderick G;Craddock TJ;Fletcher MA;Klimas NG

文献摘要

参考文献

被引文献

相似文献

There is a growing appreciation for the network biology that regulates the coordinated expression of molecular and cellular markers however questions persist regarding the identifiability of these networks. Here we explore some of the issues relevant to recovering directed regulatory networks from time course data collected under experimental constraints typical of in vivo studies. NetSim simulations of sparsely connected biological networks were used to evaluate two simple feature selection techniques used in the construction of linear Ordinary Differential Equation (ODE) models, namely truncation of terms versus latent vector projection. Performance was compared with ODE-based Time Series Network Identification (TSNI) integral, and the information-theoretic Time-Delay ARACNE (TD-ARACNE). Projection-based techniques and TSNI integral outperformed truncation-based selection and TD-ARACNE on aggregate networks with edge densities of 10-30%, i.e. transcription factor, protein-protein cliques and immune signaling networks. All were more robust to noise than truncation-based feature selection. Performance was comparable on the in silico 10-node DREAM 3 network, a 5-node Yeast synthetic network designed for In vivo Reverse-engineering and Modeling Assessment (IRMA) and a 9-node human HeLa cell cycle network of similar size and edge density. Performance was more sensitive to the number of time courses than to sample frequency and extrapolated better to larger networks by grouping experiments. In all cases performance declined rapidly in larger networks with lower edge density. Limited recovery and high false positive rates obtained overall bring into question our ability to generate informative time course data rather than the design of any particular reverse engineering algorithm.
DOI: 10.1196/annals.1407.006
发表时间: 2007-01-01
期刊: REVERSE ENGINEERING BIOLOGICAL NETWORKS
影响因子: --
作者:
Camacho, Diogo;Licona, Paola Vera;Laubenbacher, Reinhard
通讯作者: Laubenbacher, Reinhard
DOI: 10.1016/j.plrev.2005.01.001
发表时间: 2005-03-01
影响因子: 11.7
作者:
Gardner, Timothy S.;Faith, Jeremiah J.
通讯作者: Faith, Jeremiah J.
DOI: 10.1016/0022-0981(76)90076-9
发表时间: 1976-01-01
影响因子: 2
作者:
FRONTIER, S
通讯作者: FRONTIER, S
DOI: 10.1038/nbt1075
发表时间: 2005-03-01
影响因子: 46.9
作者:
di Bernardo, D;Thompson, MJ;Collins, JJ
通讯作者: Collins, JJ
DOI: 10.1038/msb4100115
发表时间: 2007
影响因子: 9.9
作者:
通讯作者: --