Boolean function network (BFN) is a systematical approach proposed to the inference of gene regulatory networks (GRNs) and the related Boolean functions. This procedure utilizes two steps to integrate hidden Markov model (HMM), likelihood ratio test and Boolean functions for discovering direct pairwise relations between genes from time-course transcriptome data. The low computational complexity of BFN makes it advantageous for the applications on the genomewide scale. In this chapter we justify the need for novel approach and describe the inference procedure.
|Title of host publication||Boolean Logic, Expressions and Theories|
|Subtitle of host publication||An Overview|
|Publisher||Nova Science Publishers, Inc.|
|Number of pages||19|
|State||Published - 1 Jan 2020|