期刊文献+

Noise decomposition algorithm and propagation mechanism in feed-forward gene transcriptional regulatory loop

Noise decomposition algorithm and propagation mechanism in feed-forward gene transcriptional regulatory loop
下载PDF
导出
摘要 Feed-forward gene transcriptional regulatory networks, as a set of common signal motifs, are widely distributed in the biological systems. In this paper, the noise characteristics and propagation mechanism of various feed-forward gene transcriptional regulatory loops are investigated, including (i) coherent feed-forward loops with AND-gate, (ii) coherent feed-forward loops with OR-gate logic, and (iii) incoherent feed-forward loops with AND-gate logic. By introducing logarithmic gain coefficient and using linear noise approximation, the theoretical formulas of noise decomposition are derived and the theoretical results are verified by Gillespie simulation. From the theoretical and numerical results of noise decomposition algorithm, three general characteristics about noise transmission in these different kinds of feed-forward loops are observed, i) The two-step noise propagation of upstream factor is negative in the incoherent feed-forward loops with AND-gate logic, that is, upstream factor can indirectly suppress the noise of downstream factors, ii) The one-step propagation noise of upstream factor is non-monotonic in the coherent feed-forward loops with OR-gate logic, iii) When the branch of the feed-forward loop is negatively controlled, the total noise of the downstream factor monotonically increases for each of all feed-forward loops. These findings are robust to variations of model parameters. These observations reveal the universal rules of noise propagation in the feed-forward loops, and may contribute to our understanding of design principle of gene circuits. Feed-forward gene transcriptional regulatory networks, as a set of common signal motifs, are widely distributed in the biological systems. In this paper, the noise characteristics and propagation mechanism of various feed-forward gene transcriptional regulatory loops are investigated, including (i) coherent feed-forward loops with AND-gate, (ii) coherent feed-forward loops with OR-gate logic, and (iii) incoherent feed-forward loops with AND-gate logic. By introducing logarithmic gain coefficient and using linear noise approximation, the theoretical formulas of noise decomposition are derived and the theoretical results are verified by Gillespie simulation. From the theoretical and numerical results of noise decomposition algorithm, three general characteristics about noise transmission in these different kinds of feed-forward loops are observed, i) The two-step noise propagation of upstream factor is negative in the incoherent feed-forward loops with AND-gate logic, that is, upstream factor can indirectly suppress the noise of downstream factors, ii) The one-step propagation noise of upstream factor is non-monotonic in the coherent feed-forward loops with OR-gate logic, iii) When the branch of the feed-forward loop is negatively controlled, the total noise of the downstream factor monotonically increases for each of all feed-forward loops. These findings are robust to variations of model parameters. These observations reveal the universal rules of noise propagation in the feed-forward loops, and may contribute to our understanding of design principle of gene circuits.
出处 《Chinese Physics B》 SCIE EI CAS CSCD 2018年第2期92-103,共12页 中国物理B(英文版)
基金 Project supported by the Fundamental Research Funds for the Central Universities,China(Grant Nos.2662015QC041 and 2662014BQ069) the Huazhong Agricultural University Scientific&Technological Self-innovation Foundation,China(Grant No.2015RC021) the National Natural Science Foundation of China(Grant Nos.11675060,91730301,11547244,and 11474117)
关键词 feed-forward loop noise propagation noise decomposition linear noise approximation feed-forward loop, noise propagation, noise decomposition, linear noise approximation
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部