arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1405.2271eess.SYcs.CEcs.SY
收藏

关于一些生物重要布尔函数的分析与生成

On Analysis and Generation of some Biologically Important Boolean Functions

Camellia Ray, Jayanta Kumar Das, Pabitra Pal Choudhury

AI总结:

本文通过Karnaugh图解决布尔函数是否为可 canalizing 函数的检测问题,并展示如何通过拼接方法生成所有可 canalizing 函数,同时研究了部分NCF在4变量下的特性。

摘要:

布尔网络被用于建模生物网络,如基因调控网络。布尔网络常表现出非常混沌的行为,对微小扰动敏感。为减少混沌行为并使基因调控网络稳定,嵌套可 canalizing 函数(NCFs)最为合适。NCF及其变种在系统生物学中有广泛应用。此前已有许多关于可 canalizing 函数应用的研究,但检查任意布尔函数是否为可 canalizing 函数的方法较少。本文通过Karnaugh图解决了这一问题,并证明当给定变量的可 canalizing 函数时,可通过拼接方法生成所有该变量的可 canalizing 函数。本文还研究了部分NCF在4变量下的特性。

英文摘要:

Boolean networks are used to model biological networks such as gene regulatory networks. Often Boolean networks show very chaotic behaviour which is sensitive to any small perturbations. In order to reduce the chaotic behaviour and to attain stability in the gene regulatory network, nested Canalizing Functions (NCFs) are best suited. NCFs and its variants have a wide range of applications in systems biology. Previously, many works were done on the application of canalizing functions, but there were fewer methods to check if any arbitrary Boolean function is canalizing or not. In this paper, by using Karnaugh Map this problem is solved and also it has been shown that when the canalizing functions of variable is given, all the canalizing functions of variable could be generated by the method of concatenation. In this paper we have uniquely identified the number of NCFs having a particular Hamming Distance (H.D) generated by each variable as starting canalizing input. Partially NCFs of 4 variables has also been studied in this paper.

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

↑