File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Algorithms and complexity analyses for control of singleton attractors in Boolean networks

TitleAlgorithms and complexity analyses for control of singleton attractors in Boolean networks
Authors
Issue Date2008
PublisherHindawi Publishing Corp. The Journal's web site is located at http://www.hindawi.com/journals/bsb/
Citation
Eurasip Journal On Bioinformatics And Systems Biology, 2008, v. 2008, article no. 521407 How to Cite?
AbstractA Boolean network (BN) is a mathematical model of genetic networks. We propose several algorithms for control of singleton attractors in BN. We theoretically estimate the average-case time complexities of the proposed algorithms, and confirm them by computer experiments. The results suggest the importance of gene ordering. Especially, setting internal nodes ahead yields shorter computational time than setting external nodes ahead in various types of algorithms. We also present a heuristic algorithm which does not look for the optimal solution but for the solution whose computational time is shorter than that of the exact algorithms.
Persistent Identifierhttp://hdl.handle.net/10722/58981
ISSN
2015 SCImago Journal Rankings: 0.324
References

 

DC FieldValueLanguage
dc.contributor.authorTamura, Ten_HK
dc.contributor.authorHayashida, Men_HK
dc.contributor.authorAkutsu, Ten_HK
dc.contributor.authorZhang, SQen_HK
dc.contributor.authorChing, WKen_HK
dc.date.accessioned2010-05-31T03:40:45Z-
dc.date.available2010-05-31T03:40:45Z-
dc.date.issued2008en_HK
dc.identifier.citationEurasip Journal On Bioinformatics And Systems Biology, 2008, v. 2008, article no. 521407en_HK
dc.identifier.issn1687-4145en_HK
dc.identifier.urihttp://hdl.handle.net/10722/58981-
dc.description.abstractA Boolean network (BN) is a mathematical model of genetic networks. We propose several algorithms for control of singleton attractors in BN. We theoretically estimate the average-case time complexities of the proposed algorithms, and confirm them by computer experiments. The results suggest the importance of gene ordering. Especially, setting internal nodes ahead yields shorter computational time than setting external nodes ahead in various types of algorithms. We also present a heuristic algorithm which does not look for the optimal solution but for the solution whose computational time is shorter than that of the exact algorithms.en_HK
dc.languageengen_HK
dc.publisherHindawi Publishing Corp. The Journal's web site is located at http://www.hindawi.com/journals/bsb/en_HK
dc.relation.ispartofEurasip Journal on Bioinformatics and Systems Biologyen_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.titleAlgorithms and complexity analyses for control of singleton attractors in Boolean networksen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1687-4145&volume=2008&spage=&epage=&date=2008&atitle=Algorithms+and+Complexity+Analyses+for+Control+of+Singleton+Attractors+in+Boolean+Networksen_HK
dc.identifier.emailChing, WK:wching@hku.hken_HK
dc.identifier.authorityChing, WK=rp00679en_HK
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1155/2008/521407en_HK
dc.identifier.scopuseid_2-s2.0-52949100547en_HK
dc.identifier.hkuros150888en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-52949100547&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume2008en_HK
dc.identifier.spagearticle no. 521407-
dc.identifier.epagearticle no. 521407-
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridTamura, T=13609056800en_HK
dc.identifier.scopusauthoridHayashida, M=9275689800en_HK
dc.identifier.scopusauthoridAkutsu, T=7102080520en_HK
dc.identifier.scopusauthoridZhang, SQ=10143093600en_HK
dc.identifier.scopusauthoridChing, WK=13310265500en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats