File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Finding incoming global states in Boolean networks

TitleFinding incoming global states in Boolean networks
Authors
Akutsu, THayashida, MZhang, SQChing, WKNg, MK
Issue Date2007
Citation
Gensips'07 - 5Th Ieee International Workshop On Genomic Signal Processing And Statistics, 2007 How to Cite?
DOI: http://dx.doi.org/10.1109/GENSIPS.2007.4365823
AbstractThis paper considers the problem of finding global states incoming to a specified global state in a Boolean network, which may be useful for pre-processing of finding a sequence of control actions for a Boolean network and for identifying the basin of attraction for a given attractor, We show that this problem is NP-hard in general along with related theoretical results, On the other hand, we present algorithms that are much faster than the naive exhaustive search-based algorithm. ©2007 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/158866
References
References in Scopus

 

DC FieldValueLanguage
dc.contributor.authorAkutsu, Ten_US
dc.contributor.authorHayashida, Men_US
dc.contributor.authorZhang, SQen_US
dc.contributor.authorChing, WKen_US
dc.contributor.authorNg, MKen_US
dc.date.accessioned2012-08-08T09:03:59Z-
dc.date.available2012-08-08T09:03:59Z-
dc.date.issued2007en_US
dc.identifier.citationGensips'07 - 5Th Ieee International Workshop On Genomic Signal Processing And Statistics, 2007en_US
dc.identifier.urihttp://hdl.handle.net/10722/158866-
dc.description.abstractThis paper considers the problem of finding global states incoming to a specified global state in a Boolean network, which may be useful for pre-processing of finding a sequence of control actions for a Boolean network and for identifying the basin of attraction for a given attractor, We show that this problem is NP-hard in general along with related theoretical results, On the other hand, we present algorithms that are much faster than the naive exhaustive search-based algorithm. ©2007 IEEE.en_US
dc.languageengen_US
dc.relation.ispartofGENSIPS'07 - 5th IEEE International Workshop on Genomic Signal Processing and Statisticsen_US
dc.titleFinding incoming global states in 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.1109/GENSIPS.2007.4365823en_US
dc.identifier.scopuseid_2-s2.0-47049095838en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-47049095838&selection=ref&src=s&origin=recordpageen_US
dc.identifier.scopusauthoridAkutsu, T=7102080520en_US
dc.identifier.scopusauthoridHayashida, M=9275689800en_US
dc.identifier.scopusauthoridZhang, SQ=10143093600en_US
dc.identifier.scopusauthoridChing, WK=13310265500en_US
dc.identifier.scopusauthoridNg, MK=34571761900en_US

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats