arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1210.0690q-bio.QMcs.AIcs.CEcs.LG
收藏

基于应答集编程的蛋白质信号网络逻辑模型形式化训练研究

Revisiting the Training of Logic Models of Protein Signaling Networks with a Formal Approach based on Answer Set Programming

CNRS(法国国家科学研究中心);IRISA(法国信息与随机系统研究所);INRIA(法国国家信息与自动化研究所);National Center for Tumor Diseases(国家肿瘤疾病中心);University of Padova(帕多瓦大学);European Bioinformatics Institute (EMBL-EBI)(欧洲生物信息研究所(EMBL-EBI));University of Potsdam(波茨坦大学)

Santiago Videla, Carito Guziolowski, Federica Eduati, Sven Thiele, Niels Grabe, Julio Saez-Rodriguez, Anne Siegel

摘要:

数学模型的构建和数据训练是系统生物学的一个基本问题。逻辑形式主义已经成为非常流行的建模信号网络,因为它们的简单性使我们能够建模包含数百个蛋白质的大型系统。最近引入了一种对高通量磷酸化蛋白质组学数据进行训练(布尔)逻辑模型的方法,并使用基于随机方法的优化算法来解决该问题。在这里,我们演示了如何使用答案集编程(ASP),一个声明性的问题解决范式,其中一个问题被编码为一个逻辑程序,使其答案集代表解决方案的问题,可以解决这个问题。ASP在效率和可扩展性方面比启发式方法有了显著的改进,它保证了解的全局最优性,并提供了完整的解集。我们说明了ASP的应用与基于现实的网络和数据的硅片的情况下。

英文摘要:

A fundamental question in systems biology is the construction and training to data of mathematical models. Logic formalisms have become very popular to model signaling networks because their simplicity allows us to model large systems encompassing hundreds of proteins. An approach to train (Boolean) logic models to high-throughput phospho-proteomics data was recently introduced and solved using optimization heuristics based on stochastic methods. Here we demonstrate how this problem can be solved using Answer Set Programming (ASP), a declarative problem solving paradigm, in which a problem is encoded as a logical program such that its answer sets represent solutions to the problem. ASP has significant improvements over heuristic methods in terms of efficiency and scalability, it guarantees global optimality of solutions as well as provides a complete set of solutions. We illustrate the application of ASP with in silico cases based on realistic networks and data.

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

↑