File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Analyses and algorithms for predecessor and control problems for boolean networks of bounded indegree

TitleAnalyses and algorithms for predecessor and control problems for boolean networks of bounded indegree
Authors
Issue Date2008
Citation
IPSJ Transactions On Bioinformatics, 2008, v. 1, p. 23-34 How to Cite?
AbstractWe study the predecessor and control problems for Boolean networks (BNs). The predecessor problem is to determine whether there exists a global state that transits to a given global state in a given BN, and the control problem is to find a sequence of 0-1 vectors for control nodes in a given BN which leads the BN to a desired global state. The predecessor problem is useful both for the control problem for BNs and for analysis of landscape of basins of attractions in BNs. In this paper, we focus on BNs of bounded indegree and show some hardness results on the computational complexity of the predecessor and control problems. We also present simple algorithms for the predecessor problem that are much faster than the naive exhaustive search-based algorithm. Furthermore, we show some results on distribution of predecessors, which leads to an improved algorithm for the control problem for BNs of bounded indegree. © 2008 Information Processing Society of Japan.
Persistent Identifierhttp://hdl.handle.net/10722/58958
ISSN
2015 SCImago Journal Rankings: 0.139
References

 

DC FieldValueLanguage
dc.contributor.authorAkutsu, Ten_HK
dc.contributor.authorHayashida, Men_HK
dc.contributor.authorZhang, SQen_HK
dc.contributor.authorChing, WKen_HK
dc.contributor.authorNg, MKen_HK
dc.date.accessioned2010-05-31T03:40:22Z-
dc.date.available2010-05-31T03:40:22Z-
dc.date.issued2008en_HK
dc.identifier.citationIPSJ Transactions On Bioinformatics, 2008, v. 1, p. 23-34en_HK
dc.identifier.issn1882-6679en_HK
dc.identifier.urihttp://hdl.handle.net/10722/58958-
dc.description.abstractWe study the predecessor and control problems for Boolean networks (BNs). The predecessor problem is to determine whether there exists a global state that transits to a given global state in a given BN, and the control problem is to find a sequence of 0-1 vectors for control nodes in a given BN which leads the BN to a desired global state. The predecessor problem is useful both for the control problem for BNs and for analysis of landscape of basins of attractions in BNs. In this paper, we focus on BNs of bounded indegree and show some hardness results on the computational complexity of the predecessor and control problems. We also present simple algorithms for the predecessor problem that are much faster than the naive exhaustive search-based algorithm. Furthermore, we show some results on distribution of predecessors, which leads to an improved algorithm for the control problem for BNs of bounded indegree. © 2008 Information Processing Society of Japan.en_HK
dc.languageengen_HK
dc.relation.ispartofIPSJ Transactions on Bioinformaticsen_HK
dc.titleAnalyses and algorithms for predecessor and control problems for boolean networks of bounded indegreeen_HK
dc.typeArticleen_HK
dc.identifier.emailChing, WK:wching@hku.hken_HK
dc.identifier.authorityChing, WK=rp00679en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.2197/ipsjtbio.1.23en_HK
dc.identifier.scopuseid_2-s2.0-79954554237en_HK
dc.identifier.hkuros153679en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-79954554237&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume1en_HK
dc.identifier.spage23en_HK
dc.identifier.epage34en_HK
dc.identifier.scopusauthoridAkutsu, T=7102080520en_HK
dc.identifier.scopusauthoridHayashida, M=9275689800en_HK
dc.identifier.scopusauthoridZhang, SQ=10143093600en_HK
dc.identifier.scopusauthoridChing, WK=13310265500en_HK
dc.identifier.scopusauthoridNg, MK=34571761900en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats