Spectral methods for testing membership in certain post classes and the class of forcing functions
Spectral methods for testing membership in certain post classes and the class of forcing functions
复制标题
DOI：
10.1109/lsp.2003.821725
复制
发表时间：
2004-01
影响因子：
3.9
通讯作者：
I. Shmulevich;H. Lähdesmäki;K. Egiazarian
中科院分区：
文献类型：
--
作者：
I. Shmulevich;H. Lähdesmäki;K. Egiazarian
强迫函数代表一类重要的布尔函数，在作为遗传调控系统模型的随机布尔网络的动力学分析中已被广泛研究。其他几个所谓的布尔函数后类与强制函数密切相关，并已用于学习理论和控制系统中。我们开发了新颖的谱算法来测试这些类中布尔函数的成员资格。这些算法非常高效，对于学习问题至关重要，特别是在重复应用相同学习程序的遗传调控网络背景下。
Forcing functions represent an important class of Boolean functions that have been extensively studied in the analysis of the dynamics of random Boolean networks as models of genetic regulatory systems. Several other so-called Post classes of Boolean functions are closely related to forcing functions and have been used in learning theory as well as in control systems. We develop novel spectral algorithms to test membership of a Boolean function in these classes. These algorithms are highly efficient and are essential in learning problems, especially in the context of genetic regulatory networks, where the same learning procedures are applied repeatedly.