English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Identification of attractors, that is, stable states and sustainedoscillations, is an important step in the analysis of Boolean models andexploration of potential variants. We describe an approach to the search forasynchronous cyclic attractors of Boolean networks that exploits, in a novelway, the established technique of elimination of components. Computation ofattractors of simplified networks allows the identification of a limited numberof candidate attractor states, which are then screened with techniques ofreachability analysis combined with trap space computation. An implementationthat brings together recently developed Boolean network analysis tools, testedon biological models and random benchmark networks, shows the potential tosignificantly reduce running times.

Attractor identification in asynchronous Boolean dynamics with network reduction