arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1804.07543cs.FL
收藏

异步二进制自动机网络可达性问题的一种启发式算法

A Heuristic for Reachability Problem in Asynchronous Binary Automata Networks

Xinwei Chai, Morgan Magnin, Olivier Roux

摘要:

针对大规模生物模型的复杂性,提出了一种新的可达性分析方法:PermReach,用于解决异步二进制自动机网络(Asynchronous Binary Automata Networks,ABAN)的可达性问题。ABAN是一个表达性建模框架,包含异步布尔网络执行的所有动力学行为。与布尔网络(BN)相比,ABAN对状态转换(从一个局部状态到另一个局部状态,而不是对称布尔函数)有更精细的描述。为了分析大规模模型(如系统生物学模型)的可达性,以前的工作展示了一种有效的抽象技术,称为局部因果图(LCG)。然而,这种技术可能不是决定性的。我们在这里的贡献是通过解决这些复杂的棘手的情况下,通过一个启发式技术来扩展这些结果。为了验证我们的方法,在大型生物网络中进行了测试,表明我们的方法比现有的方法更有说服力。

英文摘要:

On demand of efficient reachability analysis due to the inevitable complexity of large-scale biological models, this paper is dedicated to a novel approach: PermReach, for reachability problem of our new framework, Asynchronous Binary Automata Networks (ABAN). ABAN is an expressive modeling framework which contains all the dynamics behaviors performed by Asynchronous Boolean Networks. Compared to Boolean Networks (BN), ABAN has a finer description of state transitions (from a local state to another, instead of symmetric Boolean functions). To analyze the reachability properties on large-scale models (like the ones from systems biology), previous works exhibited an efficient abstraction technique called Local Causality Graph (LCG). However, this technique may be not conclusive. Our contribution here is to extend these results by tackling those complex intractable cases via a heuristic technique. To validate our method, tests were conducted in large biological networks, showing that our method is more conclusive than existing ones.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑