Scholars Central

Research articlePublished 18 Oct 2013

An efficient algorithm for finding attractors in synchronous Boolean networks with biochemical applications

Authors: D. Zheng, G. Yang, X. Li, Z. Wang, W.N.N. Hung

Genetics and Molecular Research

Volume 12 · Issue 4 · Pages 4656–4666

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

Self-organized systems, genetic regulatory systems and other living systems can be modeled as synchronous Boolean networks with stable states, which are also called state-cycle attractors (SCAs). This paper summarizes three classes of SCAs and presents a new efficient binary decision diagram based algorithm to find all SCAs of synchronous Boolean networks. After comparison with the tool BooleNet, empirical experiments with biochemical systems demonstrated the feasibility and efficiency of our approach.

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in Genetics and Molecular Research.

All its articles

Conferences in this field

Upcoming conferences in this field.

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalGenetics and Molecular Research
  • SubjectGenetics & Molecular Biology
  • BylineArticles whose byline prints “D. Zheng”
  • BylineArticles whose byline prints “G. Yang”
  • BylineArticles whose byline prints “X. Li”
  • BylineArticles whose byline prints “Z. Wang”
  • BylineArticles whose byline prints “W.N.N. Hung”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels