{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T00:25:24Z","timestamp":1773275124565,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1016\/j.ipl.2011.10.002","type":"journal-article","created":{"date-parts":[[2011,10,12]],"date-time":"2011-10-12T09:05:08Z","timestamp":1318410308000},"page":"35-38","source":"Crossref","is-referenced-by-count":5,"title":["Singleton and 2-periodic attractors of sign-definite Boolean networks"],"prefix":"10.1016","volume":"112","author":[{"given":"Tatsuya","family":"Akutsu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Avraham A.","family":"Melkman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takeyuki","family":"Tamura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.ipl.2011.10.002_br0010","first-page":"151","article-title":"A system for identifying genetic networks from gene expression patterns produced by gene disruptions and overexpressions","author":"Akutsu","year":"1998","journal-title":"Genome Informatics"},{"key":"10.1016\/j.ipl.2011.10.002_br0020","doi-asserted-by":"crossref","first-page":"1275","DOI":"10.1089\/cmb.2010.0281","article-title":"Determining a singleton attractor of a Boolean network with nested canalyzing functions","volume":"18","author":"Akutsu","year":"2011","journal-title":"Journal of Computational Biology"},{"key":"10.1016\/j.ipl.2011.10.002_br0030","article-title":"Discrete Mathematics of Neural Networks: Selected Topics","author":"Anthony","year":"1987"},{"key":"10.1016\/j.ipl.2011.10.002_br0040","doi-asserted-by":"crossref","first-page":"1398","DOI":"10.1007\/s11538-008-9304-7","article-title":"On the number of fixed points in regulatory Boolean networks","volume":"70","author":"Aracena","year":"2008","journal-title":"Bulletin of Mathematical Biology"},{"key":"10.1016\/j.ipl.2011.10.002_br0050","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1109\/TNN.2003.821555","article-title":"Positive and negative circuits in discrete neural networks","volume":"15","author":"Aracena","year":"2004","journal-title":"IEEE Transactions on Neural Networks"},{"key":"10.1016\/j.ipl.2011.10.002_br0060","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1016\/j.aam.2010.03.002","article-title":"Sequential operator for filtering cycles in Boolean networks","volume":"45","author":"Goles","year":"2010","journal-title":"Advances in Applied Mathematics"},{"key":"10.1016\/j.ipl.2011.10.002_br0070","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/cplx.10022","article-title":"A model of transcriptional regulatory networks based on biases in the observed regulation rules","volume":"7","author":"Harris","year":"2002","journal-title":"Complexity"},{"key":"10.1016\/j.ipl.2011.10.002_br0080","author":"Just"},{"key":"10.1016\/j.ipl.2011.10.002_br0090","series-title":"The Origins of Order: Self-organization and Selection Evolution","author":"Kauffman","year":"1993"},{"key":"10.1016\/j.ipl.2011.10.002_br0100","doi-asserted-by":"crossref","first-page":"14796","DOI":"10.1073\/pnas.2036429100","article-title":"Random Boolean network models and the yeast transcriptional network","volume":"100","author":"Kauffman","year":"2003","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"10.1016\/j.ipl.2011.10.002_br0110","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1016\/S0012-365X(02)00507-1","article-title":"On the distribution of the number of monotone Boolean functions relative to the number of lower units","volume":"257","author":"Korshunov","year":"2002","journal-title":"Discrete Mathematics"},{"key":"10.1016\/j.ipl.2011.10.002_br0120","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1016\/j.ipl.2010.05.001","article-title":"Determining a singleton attractor of an AND\/OR Boolean network in O(1.587n) time","volume":"110","author":"Melkman","year":"2010","journal-title":"Information Processing Letters"},{"key":"10.1016\/j.ipl.2011.10.002_br0130","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0166-218X(85)90076-9","article-title":"Connection-graph and iteration-graph of monotone Boolean functions","volume":"11","author":"Robert","year":"1985","journal-title":"Discrete Appl. Math."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0020019011002675?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0020019011002675?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,11,29]],"date-time":"2018-11-29T15:57:19Z","timestamp":1543507039000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019011002675"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1]]},"references-count":13,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["S0020019011002675"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.ipl.2011.10.002","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2012,1]]}}}