arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2501.02634q-bio.MN
收藏

异步布尔网络模型的最优推断

Optimal Inference of Asynchronous Boolean Network Models

Fitchburg State University(菲奇堡州立大学)

Guy Karlebach

AI总结:

提出一种基于算法复杂度的最优推断方法,用于从实验数据中推断异步布尔网络模型,并解决伪时间推断问题。

摘要:

网络推断问题出现在生物学研究中,当需要定量选择最佳蛋白质相互作用模型以解释表型时。数据的多样性和非线性动力学对寻找最佳方法提出了重大挑战。除了平衡拟合和模型大小外,还必须考虑计算效率。重要的是,在受实验噪声影响的测量背后,存在一个复杂的计算机制,其本质上是难以识别的。为了解决这些挑战,我们提出了一种新颖的方法,利用算法复杂度从实验数据中推断布尔网络模型。我们提出了一种在该框架内最优的算法,并允许网络动力学中的异步性。此外,我们表明,使用我们的方法,与单细胞数据分析相关的伪时间推断问题可以与网络推断交织在一起。结果在知识推导和模拟网络上进行了描述。

英文摘要:

The network inference problem arises in biological research when one wishes to explain a phenotype using a network of interactions between molecules. The diverse nature of the data and nonlinear dynamics of the network pose significant challenges in choosing the best model. In addition to balancing fit and model size, computational efficiency must be considered. The latter constitutes a central consideration for the researcher since underlying the measurements, which are affected by experimental noise, there is a complex computational mechanism that may be asynchronous and is inherently hard to identify. To address these challenges, we present a novel approach that uses algorithmic complexity to infer an asynchronous Boolean network model from experimental data. We present an algorithm that is optimal within this framework and allows for asynchronicity in network dynamics. Results are described for real data, a literature-derived network and random networks.

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

↑