### Abstract

Language | English |
---|---|

Pages | 1-16 |

Number of pages | 16 |

Journal | EURASIP Journal on Bioinformatics and Systems Biology |

Volume | 2007 |

Issue number | 1 |

DOIs | |

Publication status | Published - 7 May 2007 |

### Fingerprint

### Keywords

- gene regularity networks
- genomic signal processing
- probabilistic Boolean networks

### Cite this

*EURASIP Journal on Bioinformatics and Systems Biology*,

*2007*(1), 1-16. https://doi.org/10.1155/2007/32454

}

*EURASIP Journal on Bioinformatics and Systems Biology*, vol. 2007, no. 1, pp. 1-16. https://doi.org/10.1155/2007/32454

**Inference of a probabilistic Boolean network from a single observed temporal sequence.** / Marshall, S.; Yu, L.; Xiao, Y.; Dougherty, E.

Research output: Contribution to journal › Article

TY - JOUR

T1 - Inference of a probabilistic Boolean network from a single observed temporal sequence

AU - Marshall, S.

AU - Yu, L.

AU - Xiao, Y.

AU - Dougherty, E.

PY - 2007/5/7

Y1 - 2007/5/7

N2 - The inference of gene regulatory networks is a key issue for genomic signal processing. This paper addresses the inference of probabilistic Boolean networks (PBNs) from observed temporal sequences of network states. Since a PBN is composed of a finite number of Boolean networks, a basic observation is that the characteristics of a single Boolean network without perturbation may be determined by its pairwise transitions. Because the network function is fixed and there are no perturbations, a given state will always be followed by a unique state at the succeeding time point. Thus, a transition counting matrix compiled over a data sequence will be sparse and contain only one entry per line. If the network also has perturbations, with small perturbation probability, then the transition counting matrix would have some insignificant nonzero entries replacing some (or all) of the zeros. If a data sequence is sufficiently long to adequately populate the matrix, then determination of the functions and inputs underlying the model is straightforward. The difficulty comes when the transition counting matrix consists of data derived from more than one Boolean network. We address the PBN inference procedure in several steps: (1) separate the data sequence into "pure" subsequences corresponding to constituent Boolean networks; (2) given a subsequence, infer a Boolean network; and (3) infer the probabilities of perturbation, the probability of there being a switch between constituent Boolean networks, and the selection probabilities governing which network is to be selected given a switch. Capturing the full dynamic behavior of probabilistic Boolean networks, be they binary or multivalued, will require the use of temporal data, and a great deal of it. This should not be surprising given the complexity of the model and the number of parameters, both transitional and static, that must be estimated. In addition to providing an inference algorithm, this paper demonstrates that the data requirement is much smaller if one does not wish to infer the switching, perturbation, and selection probabilities, and that constituent-network connectivity can be discovered with decent accuracy for relatively small time-course sequences.

AB - The inference of gene regulatory networks is a key issue for genomic signal processing. This paper addresses the inference of probabilistic Boolean networks (PBNs) from observed temporal sequences of network states. Since a PBN is composed of a finite number of Boolean networks, a basic observation is that the characteristics of a single Boolean network without perturbation may be determined by its pairwise transitions. Because the network function is fixed and there are no perturbations, a given state will always be followed by a unique state at the succeeding time point. Thus, a transition counting matrix compiled over a data sequence will be sparse and contain only one entry per line. If the network also has perturbations, with small perturbation probability, then the transition counting matrix would have some insignificant nonzero entries replacing some (or all) of the zeros. If a data sequence is sufficiently long to adequately populate the matrix, then determination of the functions and inputs underlying the model is straightforward. The difficulty comes when the transition counting matrix consists of data derived from more than one Boolean network. We address the PBN inference procedure in several steps: (1) separate the data sequence into "pure" subsequences corresponding to constituent Boolean networks; (2) given a subsequence, infer a Boolean network; and (3) infer the probabilities of perturbation, the probability of there being a switch between constituent Boolean networks, and the selection probabilities governing which network is to be selected given a switch. Capturing the full dynamic behavior of probabilistic Boolean networks, be they binary or multivalued, will require the use of temporal data, and a great deal of it. This should not be surprising given the complexity of the model and the number of parameters, both transitional and static, that must be estimated. In addition to providing an inference algorithm, this paper demonstrates that the data requirement is much smaller if one does not wish to infer the switching, perturbation, and selection probabilities, and that constituent-network connectivity can be discovered with decent accuracy for relatively small time-course sequences.

KW - gene regularity networks

KW - genomic signal processing

KW - probabilistic Boolean networks

U2 - 10.1155/2007/32454

DO - 10.1155/2007/32454

M3 - Article

VL - 2007

SP - 1

EP - 16

JO - EURASIP Journal on Bioinformatics and Systems Biology

T2 - EURASIP Journal on Bioinformatics and Systems Biology

JF - EURASIP Journal on Bioinformatics and Systems Biology

SN - 1687-4145

IS - 1

ER -