{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T01:41:52Z","timestamp":1778636512887,"version":"3.51.4"},"reference-count":14,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2015]]},"DOI":"10.1587\/transfun.e98.a.384","type":"journal-article","created":{"date-parts":[[2015,1,5]],"date-time":"2015-01-05T02:22:03Z","timestamp":1420424523000},"page":"384-390","source":"Crossref","is-referenced-by-count":1,"title":["A Fixed-Parameter Algorithm for Detecting a Singleton Attractor in an AND\/OR Boolean Network with Bounded Treewidth"],"prefix":"10.1587","volume":"E98.A","author":[{"given":"Chia-Jung","family":"CHANG","sequence":"first","affiliation":[{"name":"Department of Computer Science and Information Engineering, National Taiwan University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takeyuki","family":"TAMURA","sequence":"additional","affiliation":[{"name":"Bioinformatics Center, Institute for Chemical Research, Kyoto University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kun-Mao","family":"CHAO","sequence":"additional","affiliation":[{"name":"Graduate Institute of Biomedical Electronics and Bioinformatics, National Taiwan University"},{"name":"Department of Computer Science and Information Engineering, National Taiwan University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tatsuya","family":"AKUTSU","sequence":"additional","affiliation":[{"name":"Bioinformatics Center, Institute for Chemical Research, Kyoto University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] T. Akutsu, S. Kosub, A.A. Melkman, and T. Tamura, \u201cFinding a periodic attractor of a Boolean network,\u201d IEEE\/ACM Trans. Computational Biology and Bioinformatics, vol.9, pp.151-160, 2012.","DOI":"10.1109\/TCBB.2012.87"},{"key":"2","unstructured":"[2] J. Chen, B. Chor, M. Fellows, X. Huang, D. Juedes, I. Kanj, and G. Xia, \u201cTight lower bounds for certain parameterized NP-hard problems,\u201d Proc. 19th IEEE Annual Conference on Computational Complexity, pp.150-160, 2004."},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] V. Devloo, P. Hansen, and M. Labb\u00e9, \u201cIdentification of all steady states in large networks by logical analysis,\u201d Bulletin of Mathematical Biology, vol.65, pp.1025-1051, 2003.","DOI":"10.1016\/S0092-8240(03)00061-2"},{"key":"4","unstructured":"[4] E. Dubrova and M. Teslenko, \u201cA SAT-based algorithm for finding attractors in synchronous Boolean networks,\u201d IEEE\/ACM Trans. Computational Biology and Bioinformatics, vol.8, pp.1393-1398, 2011."},{"key":"5","unstructured":"[5] J. Flum and M. Grohe, Parameterized Complexity Theory, Springer, 2006."},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] A. Garg, A. DiCara, I. Xenarios, L. Mendoza, and G. DeMichel, \u201cSynchronous versus asynchronous modelling of gene regulatory networks,\u201d Bioinformatics, vol.24, pp.1917-1925, 2008.","DOI":"10.1093\/bioinformatics\/btn336"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] A.S. Jarrah, B. Raposa, and R. Laubenbacher, \u201cNested canalyzing, unate cascade, and polynomial functions,\u201d Physica D, vol.233, pp.167-174, 2007.","DOI":"10.1016\/j.physd.2007.06.022"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] S.A. Kauffman, The Origins of Order: Self-organization and Selection in Evolution, Oxford Univ. Press, New York, 1993.","DOI":"10.1007\/978-94-015-8054-0_8"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] A.A. Melkman, T. Tamura, and T. Akutsu, \u201cDetermining a singleton attractor of an AND\/OR Boolean network in <i>O<\/i>(1.587<i><sup>n<\/sup><\/i>) time,\u201d Inf. Process. Lett., vol.110, pp.565-569, 2010.","DOI":"10.1016\/j.ipl.2010.05.001"},{"key":"10","unstructured":"[10] J. Ne\u0161etril and S. Poljak, \u201cOn the complexity of the subgraph problem,\u201d Commentationes Mathematicae Universitatis Carolinae, vol.26, no.2, pp.415-419, 1985."},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] H. Tamaki, \u201cA directed path-decomposition approach to exactly identifying attractors of Boolean networks,\u201d Proc. 10th International Symposium on Communications and Information Technologies, pp.844-849, 2010.","DOI":"10.1109\/ISCIT.2010.5665106"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] T. Tamura and T. Akutsu, \u201cDetecting a singleton attractor in a Boolean network utilizing SAT algorithms,\u201d IEICE Trans. Fundamentals, vol.E92-A, pp.493-501, 2009.","DOI":"10.1587\/transfun.E92.A.493"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] H.L. Bodlaender, \u201cA linear time algorithm for finding tree-decompositions of small treewidth,\u201d Proc. 25th Annual ACM Symposium on Theory of Computing. ACM, pp.226-234, 1993.","DOI":"10.1145\/167088.167161"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] J. Alber and R. Niedermeier, \u201cImproved tree decomposition based algorithms for domination-like problems,\u201d LATIN 2002: Theoretical Informatics, pp.613-627, Springer Berlin Heidelberg, 2002.","DOI":"10.1007\/3-540-45995-2_52"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.jstage.jst.go.jp\/article\/transfun\/E98.A\/1\/E98.A_384\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,19]],"date-time":"2019-08-19T01:55:20Z","timestamp":1566179720000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.jstage.jst.go.jp\/article\/transfun\/E98.A\/1\/E98.A_384\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015]]}},"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1587\/transfun.e98.a.384","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}