An Evaluation of Methods for Inferring Boolean Networks from Time-Series Data
| dc.citation.firstpage | e66031 | en_US |
| dc.citation.issueNumber | 6 | en_US |
| dc.citation.journalTitle | PLoS One | en_US |
| dc.citation.volumeNumber | 8 | en_US |
| dc.contributor.author | Berestovsky, Natalie | en_US |
| dc.contributor.author | Nakhleh, Luay | en_US |
| dc.date.accessioned | 2013-07-12T19:38:31Z | en_US |
| dc.date.available | 2013-07-12T19:38:31Z | en_US |
| dc.date.issued | 2013 | en_US |
| dc.description.abstract | Regulatory networks play a central role in cellular behavior and decision making. Learning these regulatory networks is a major task in biology, and devising computational methods and mathematical models for this task is a major endeavor in bioinformatics. Boolean networks have been used extensively for modeling regulatory networks. In this model, the state of each gene can be either ‘on’ or ‘off’ and that next-state of a gene is updated, synchronously or asynchronously, according to a Boolean rule that is applied to the current-state of the entire system. Inferring a Boolean network from a set of experimental data entails two main steps: first, the experimental time-series data are discretized into Boolean trajectories, and then, a Boolean network is learned from these Boolean trajectories. In this paper, we consider three methods for data discretization, including a new one we propose, and three methods for learning Boolean networks, and study the performance of all possible nine combinations on four regulatory systems of varying dynamics complexities. We find that employing the right combination of methods for data discretization and network learning results in Boolean networks that capture the dynamics well and provide predictive power. Our findings are in contrast to a recent survey that placed Boolean networks on the low end of the ‘‘faithfulness to biological reality’’ and ‘‘ability to model dynamics’’ spectra. Further, contrary to the common argument in favor of Boolean networks, we find that a relatively large number of time points in the timeseries data is required to learn good Boolean networks for certain data sets. Last but not least, while methods have been proposed for inferring Boolean networks, as discussed above, missing still are publicly available implementations thereof. Here, we make our implementation of the methods available publicly in open source at http://bioinfo.cs.rice.edu/. | en_US |
| dc.embargo.terms | none | en_US |
| dc.identifier.citation | Berestovsky, Natalie and Nakhleh, Luay. "An Evaluation of Methods for Inferring Boolean Networks from Time-Series Data." <i>PLoS One,</i> 8, no. 6 (2013) Public Library of Science: e66031. https://doi.org/10.1371/journal.pone.0066031. | en_US |
| dc.identifier.doi | https://doi.org/10.1371/journal.pone.0066031 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1911/71544 | en_US |
| dc.language.iso | eng | en_US |
| dc.publisher | Public Library of Science | en_US |
| dc.rights | This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. | en_US |
| dc.rights.uri | https://creativecommons.org/licenses/by/4.0/ | en_US |
| dc.title | An Evaluation of Methods for Inferring Boolean Networks from Time-Series Data | en_US |
| dc.type | Journal article | en_US |
| dc.type.dcmi | Text | en_US |
| dc.type.publication | publisher version | en_US |