{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T20:44:35Z","timestamp":1776458675790,"version":"3.51.2"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,10,7]],"date-time":"2015-10-07T00:00:00Z","timestamp":1444176000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s11047-015-9520-7","type":"journal-article","created":{"date-parts":[[2015,10,7]],"date-time":"2015-10-07T02:57:08Z","timestamp":1444186628000},"page":"535-544","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":59,"title":["Computing maximal and minimal trap spaces of Boolean networks"],"prefix":"10.1007","volume":"14","author":[{"given":"Hannes","family":"Klarner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Bockmayr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heike","family":"Siebert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,10,7]]},"reference":[{"key":"9520_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511852008","volume-title":"Boolean functions: theory, algorithms, and applications","author":"Y Crama","year":"2011","unstructured":"Crama Y, Hammer PL (2011) Boolean functions: theory, algorithms, and applications, vol 142. Cambridge University Press, Cambridge"},{"issue":"5","key":"9520_CR2","doi-asserted-by":"crossref","first-page":"1393","DOI":"10.1109\/TCBB.2010.20","volume":"8","author":"E Dubrova","year":"2011","unstructured":"Dubrova E, Teslenko M (2011) A SAT-based algorithm for finding attractors in synchronous boolean networks. IEEE\/ACM Trans Comput Biol Bioinform (TCBB) 8(5):1393\u20131399","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform (TCBB)"},{"key":"9520_CR3","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0304-3975(85)90171-9","volume":"40","author":"F Fogelman-Soulie","year":"1985","unstructured":"Fogelman-Soulie F (1985) Parallel and sequential computation on boolean networks. Theor comput sci 40:275\u2013300","journal-title":"Theor comput sci"},{"issue":"17","key":"9520_CR4","doi-asserted-by":"crossref","first-page":"1917","DOI":"10.1093\/bioinformatics\/btn336","volume":"24","author":"A Garg","year":"2008","unstructured":"Garg A, Di Cara A, Xenarios I, Mendoza L, De Micheli G (2008) Synchronous versus asynchronous modeling of gene regulatory networks. Bioinform 24(17):1917\u20131925","journal-title":"Bioinform"},{"issue":"2","key":"9520_CR5","doi-asserted-by":"crossref","first-page":"107","DOI":"10.3233\/AIC-2011-0491","volume":"24","author":"M Gebser","year":"2011","unstructured":"Gebser M, Kaminski R, Kaufmann B, Ostrowski M, Schaub T, Schneider M (2011) Potassco: the potsdam answer set solving collection. Ai Commun 24(2):107\u2013124","journal-title":"Ai Commun"},{"key":"9520_CR6","doi-asserted-by":"crossref","unstructured":"Gershenson C (2004) Updating schemes in random boolean networks: do they really matter. In: Artificial life IX Proceedings of the 9th international conference on the simulation and synthesis of living systems, MIT Press, pp 238\u2013243","DOI":"10.7551\/mitpress\/1429.003.0040"},{"issue":"10","key":"9520_CR7","doi-asserted-by":"crossref","first-page":"e1003,286","DOI":"10.1371\/journal.pcbi.1003286","volume":"9","author":"L Grieco","year":"2013","unstructured":"Grieco L, Calzone L, Bernard-Pierrot I, Radvanyi F, Kahn-Perl\u00e8s B, Thieffry D (2013) Integrative modelling of the influence of mapk network on cancer cell fate decision. PLoS comput Biol 9(10):e1003,286","journal-title":"PLoS comput Biol"},{"key":"9520_CR8","unstructured":"Gurobi Optimization I (2015) Gurobi optimizer reference manual. www.gurobi.com"},{"key":"9520_CR9","doi-asserted-by":"crossref","unstructured":"Jabbour S, Marques-Silva J, Sais L, Salhi Y (2014) Enumerating prime implicants of propositional formulae in conjunctive normal form. In: Ferm\u00e9 E, Leite J (eds) Logics in artificial intelligence. Springer, pp 152\u2013165","DOI":"10.1007\/978-3-319-11558-0_11"},{"key":"9520_CR10","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195079517.001.0001","volume-title":"The origins of order: self organization and selection in evolution","author":"SA Kauffman","year":"1993","unstructured":"Kauffman SA (1993) The origins of order: self organization and selection in evolution. Oxford University Press, USA"},{"key":"9520_CR11","unstructured":"Klarner H (2015) www.sourceforge.net\/Projects\/BoolNetFixpoints"},{"key":"9520_CR12","doi-asserted-by":"crossref","unstructured":"Klarner H, Bockmayr A, Siebert H (2014) Computing symbolic steady states of boolean networks. In: Was J, Sirakoulis G, Bandini S (eds) Cellular Automata, Lecture Notes in Computer Science, vol 8751, Springer International Publishing, pp 561\u2013570","DOI":"10.1007\/978-3-319-11520-7_59"},{"key":"9520_CR13","doi-asserted-by":"crossref","first-page":"1378","DOI":"10.1093\/bioinformatics\/btq124","volume":"10","author":"C M\u00fcssel","year":"2010","unstructured":"M\u00fcssel C, Hopfensitz M, Kestler HA (2010) Boolnet\u2014an R package for generation, reconstruction, and analysis of boolean networks. Bioinformatics 10:1378\u20131380","journal-title":"Bioinformatics"},{"key":"9520_CR14","doi-asserted-by":"crossref","unstructured":"Paulev\u00e9 L, Chancellor C, Folschette M, Magnin M, Roux O (2014) Analyzing large network dynamics with process hitting. Log Model Biol Syst pp 125\u2013166. doi: 10.1002\/9781119005223.ch4","DOI":"10.1002\/9781119005223.ch4"},{"key":"9520_CR15","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1007\/s11538-010-9609-1","volume":"73","author":"H Siebert","year":"2011","unstructured":"Siebert H (2011) Analysis of discrete bioregulatory networks using symbolic steady states. Bull Math Biol 73:873\u2013898. doi: 10.1007\/s11538-010-9609-1","journal-title":"Bull Math Biol"},{"issue":"5","key":"9520_CR16","doi-asserted-by":"crossref","first-page":"055,001","DOI":"10.1088\/1478-3975\/9\/5\/055001","volume":"9","author":"RS Wang","year":"2012","unstructured":"Wang RS, Saadatpour A, Albert R (2012) Boolean modeling in systems biology: an overview of methodology and applications. Phys Biol 9(5):055,001","journal-title":"Phys Biol"},{"issue":"2","key":"9520_CR17","first-page":"025","volume":"23","author":"JG Za\u00f1udo","year":"2013","unstructured":"Za\u00f1udo JG, Albert R (2013) An effective network reduction approach to find the dynamical repertoire of discrete dynamic networks. Chaos: an interdisciplinary. J Nonlinear Sci 23(2):025\u2013111","journal-title":"J Nonlinear Sci"}],"updated-by":[{"DOI":"10.1007\/s11047-016-9611-0","type":"erratum","label":"Erratum","source":"publisher","updated":{"date-parts":[[2017,1,10]],"date-time":"2017-01-10T00:00:00Z","timestamp":1484006400000}}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-015-9520-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-015-9520-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-015-9520-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T16:04:24Z","timestamp":1718121864000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-015-9520-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,7]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["9520"],"URL":"https:\/\/doi.org\/10.1007\/s11047-015-9520-7","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,7]]}}}