arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2106.06580cs.CCq-bio.QM
收藏

揭示布尔函数的 canalizing 结构:算法与应用

Revealing the canalizing structure of Boolean functions: Algorithms and applications

Elena Dimitrova, Brandilyn Stigler, Claus Kadelka, David Murrugarra

AI总结:

本文研究布尔函数 canalizing 层格式的识别问题,证明该问题为 NP-hard,提出多种算法并比较性能,展示了其在嵌套 canalizing 函数析取范式求解和布尔网络逆向工程中的应用。

摘要:

布尔函数可以通过多种方式表示,包括逻辑形式、真值表和多项式。此外,布尔函数有不同的规范表示,如最小析取范式。另一种规范表示基于布尔函数的多项式表示,其中它们可以写成 canalizing 层的嵌套乘积与包含非 canalizing 变量的多项式。在本文中,我们研究了识别布尔函数 canalizing 层格式的问题。首先,我们证明寻找 canalizing 层的问题是 NP-hard 的。其次,我们提出了几种寻找布尔函数 canalizing 层的算法,讨论了它们的复杂度,并比较了它们的性能。第三,我们展示了 canalizing 层计算的应用,可用于寻找嵌套 canalizing 函数的析取范式。另一个应用涉及具有指定分层格式的布尔网络的逆向工程。最后,我们的算法在 Python 和计算机代数系统 Macaulay2 中的实现可在 https://github.com/ckadelka/BooleanCanalization 获取。

英文摘要:

Boolean functions can be represented in many ways including logical forms, truth tables, and polynomials. Additionally, Boolean functions have different canonical representations such as minimal disjunctive normal forms. Other canonical representation is based on the polynomial representation of Boolean functions where they can be written as a nested product of canalizing layers and a polynomial that contains the noncanalizing variables. In this paper we study the problem of identifying the canalizing layers format of Boolean functions. First, we show that the problem of finding the canalizing layers is NP-hard. Second, we present several algorithms for finding the canalizing layers of a Boolean function, discuss their complexities, and compare their performances. Third, we show applications where the computation of canalizing layers can be used for finding a disjunctive normal form of a nested canalizing function. Another application deals with the reverse engineering of Boolean networks with a prescribed layering format. Finally, implementations of our algorithms in Python and in the computer algebra system Macaulay2 are available at https://github.com/ckadelka/BooleanCanalization.

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

↑