Scalable Steady State Analysis of Boolean Biological Regulatory Networks
Ferhat Ay, Fei Xu, Tamer Kahveci · 2009
Read Scalable Steady State Analysis of Boolean Biological Regulatory Networks by Ferhat Ay, Fei Xu, Tamer Kahveci (2009) in the Tower of Babel, a free online library of public-domain works preserved in clean, searchable text. No sign-up. The full text is served as a plain-text file at a predictable URL, where text is present: https://antarctic-labs.com/tower-of-babel/plos-pone-0007992.txt.
Description
Ferhat Ay, Fei Xu, and Tamer Kahveci tackled a hard computing problem in cell biology for PLOS ONE in 2009. Gene networks can be modeled as switches that are on or off. Their settled states, called steady states, show how the network will behave in the long run.
Finding every settled state grows hard fast as networks grow. The team's methods scale that search to much larger networks than older tools could handle. Big, true-to-life networks can now be mapped in full, which helps modelers test ideas about disease and drug effects before lab work begins.
Catalog record
| CREATOR | Ferhat Ay, Fei Xu, Tamer Kahveci |
|---|---|
| YEAR | 2009 |
| COLLECTION | PAPERS |
| FORMAT | TXT |
| FILE SIZE | 48 KB |
| LICENSE | Creative Commons Attribution License |
| RIGHTS | CC BY |
| SOURCE | PLOS ONE |
Source: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0007992