Computing Hierarchical Transition Graphs of Asynchronous Genetic Regulatory Networks.

Communications in Computer and Information Science(2018)

引用 0|浏览15
暂无评分
摘要
In the field of theoretical biology the study of the dynamics of the so-called gene regulatory networks is useful to follow the relationship between the expression of a gene and its dynamic regulatory effect on the cell fate. To date, most of the models developed for this purpose, applies the synchronous update schedule while reality is far from being so. On the other hand, the more realistic asynchronous update requires to compute all possible updates at each single instant, thus bearing a much greater computational load. In the present work, we describe a novel method that addresses the problem of efficiently exploring the dynamics of a gene regulatory network with the asynchronous update.
更多
查看译文
关键词
SAT solver,Discrete dynamical systems,Tarjan's algorithm,Gene regulatory networks,Strongly connected components
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要