File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: On the complexity of finding control strategies for Boolean networks

TitleOn the complexity of finding control strategies for Boolean networks
Authors
Akutsu, THayashida, MChing, WKNg, MK
Issue Date2006
PublisherWorld Scientific Publishing Co Pte Ltd. The Journal's web site is located at http://www.worldscibooks.com/series/abcb_series.shtml
Citation
4th Asia-Pacific Bioinformatics Conference (APBC 2006), Taipei, Taiwan, 13-16 February 2006. In Proceedings of the 4th Asia-Pacific Bioinformatics Conference, 2006, p. 99-108 How to Cite?
DOI: http://dx.doi.org/10.1142/9781860947292_0013
AbstractThis paper considers a problem of finding control strategies for Boolean networks, where Boolean networks have been used as a model of genetic networks. This paper shows that finding a control strategy leading to the desired global state is NP-hard even if there is only one control node in the network. This result justifies existing exponential time algorithms for finding control strategies for probabilistic Boolean networks. On the other hand, this paper shows that the problem can be solved in polynomial time if the network has a tree structure.
Persistent Identifierhttp://hdl.handle.net/10722/158884
ISBN
9781860946233
ISSN
1751-6404
Series/Report no.Series on Advances in Bioinformatics and Computational Biology ; 3
References
References in Scopus

 

DC FieldValueLanguage
dc.contributor.authorAkutsu, Ten_US
dc.contributor.authorHayashida, Men_US
dc.contributor.authorChing, WKen_US
dc.contributor.authorNg, MKen_US
dc.date.accessioned2012-08-08T09:04:05Z-
dc.date.available2012-08-08T09:04:05Z-
dc.date.issued2006en_US
dc.identifier.citation4th Asia-Pacific Bioinformatics Conference (APBC 2006), Taipei, Taiwan, 13-16 February 2006. In Proceedings of the 4th Asia-Pacific Bioinformatics Conference, 2006, p. 99-108en_US
dc.identifier.isbn9781860946233-
dc.identifier.issn1751-6404en_US
dc.identifier.urihttp://hdl.handle.net/10722/158884-
dc.description.abstractThis paper considers a problem of finding control strategies for Boolean networks, where Boolean networks have been used as a model of genetic networks. This paper shows that finding a control strategy leading to the desired global state is NP-hard even if there is only one control node in the network. This result justifies existing exponential time algorithms for finding control strategies for probabilistic Boolean networks. On the other hand, this paper shows that the problem can be solved in polynomial time if the network has a tree structure.en_US
dc.languageengen_US
dc.publisherWorld Scientific Publishing Co Pte Ltd. The Journal's web site is located at http://www.worldscibooks.com/series/abcb_series.shtmlen_US
dc.relation.ispartofProceedings of the 4th Asia-Pacific Bioinformatics Conferenceen_US
dc.relation.ispartofseriesSeries on Advances in Bioinformatics and Computational Biology ; 3-
dc.titleOn the complexity of finding control strategies for Boolean networksen_US
dc.typeConference_Paperen_US
dc.identifier.emailChing, WK:wching@hku.hken_US
dc.identifier.authorityChing, WK=rp00679en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1142/9781860947292_0013-
dc.identifier.scopuseid_2-s2.0-84856983892en_US
dc.identifier.hkuros114591-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-84856983892&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume3en_US
dc.identifier.spage99en_US
dc.identifier.epage108en_US
dc.publisher.placeSingaporeen_US
dc.identifier.scopusauthoridAkutsu, T=7102080520en_US
dc.identifier.scopusauthoridHayashida, M=9275689800en_US
dc.identifier.scopusauthoridChing, WK=13310265500en_US
dc.identifier.scopusauthoridNg, MK=34571761900en_US
dc.identifier.issnl1751-6404-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats