{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T18:38:49Z","timestamp":1720636729087},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T00:00:00Z","timestamp":1664323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T00:00:00Z","timestamp":1664323200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s11227-022-04809-5","type":"journal-article","created":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T14:03:19Z","timestamp":1664373799000},"page":"4556-4581","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Representation of gene regulation networks by hypothesis logic-based Boolean systems"],"prefix":"10.1007","volume":"79","author":[{"given":"Pierre","family":"Siegel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrei","family":"Doncescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Risch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sylvain","family":"Sen\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,28]]},"reference":[{"key":"4809_CR1","doi-asserted-by":"publisher","first-page":"2365","DOI":"10.1098\/rsif.2012.0080","volume":"9","author":"OE Akman","year":"2012","unstructured":"Akman OE, Watterson S, Parton A, Binns N, Millar AJ, Ghazal P (2012) Digital clocks: simple Boolean models can quantitatively describe circadian systems. J R Soc Interface 9:2365\u20132382","journal-title":"J R Soc Interface"},{"key":"4809_CR2","doi-asserted-by":"crossref","unstructured":"Akutsu T (2018) Algorithms For analysis, inference, and control of boolean networks, 9789813233447, World Scientific Publishing Company","DOI":"10.1142\/10801"},{"key":"4809_CR3","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.jtbi.2005.07.011","volume":"239","author":"J Aracena","year":"2006","unstructured":"Aracena J, Gonz\u00e1lez M, Zu\u00f1iga A, Mendez MA, Cambiazo V (2006) Regulatory network for cell shape changes during Drosophila ventral furrow formation. J Theor Biol 239:49\u201362","journal-title":"J Theor Biol"},{"key":"4809_CR4","doi-asserted-by":"publisher","unstructured":"Cardell S, F\u00faster-Sabater A (2019) Binomial representation of cryptographic binary sequences and its relation to cellular automata, Complexity, Article ID 2108014. https:\/\/doi.org\/10.1155\/2019\/2108014","DOI":"10.1155\/2019\/2108014"},{"key":"4809_CR5","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0001672","volume":"3","author":"MI Davidich","year":"2008","unstructured":"Davidich MI, Bornholdt S (2008) Boolean network model predicts cell cycle sequence of fission yeast. PLoS ONE 3:e1672","journal-title":"PLoS ONE"},{"key":"4809_CR6","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1002\/cplx.20100","volume":"11","author":"S Dealy","year":"2005","unstructured":"Dealy S, Kauffman S, Socolar J (2005) Modeling pathways of differentiation in genetic regulatory networks with Boolean networks. Complexity 11:52\u201360","journal-title":"Complexity"},{"key":"4809_CR7","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1093\/logcom\/exi021","volume":"15","author":"JP Delgrande","year":"2005","unstructured":"Delgrande JP, Schaub T (2005) Expressing default logic variants in default logic. J Log Comput 15:593\u2013621","journal-title":"J Log Comput"},{"key":"4809_CR8","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.jtbi.2011.03.023","volume":"280","author":"J Demongeot","year":"2011","unstructured":"Demongeot J, Elena A, Noual M, Sen\u00e9 S, Thuderoz F (2011) \u201cImmunetworks\u2019\u2019, intersecting circuits and dynamics. J Theor Biol 280:19\u201333","journal-title":"J Theor Biol"},{"key":"4809_CR9","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0011793","volume":"5","author":"J Demongeot","year":"2010","unstructured":"Demongeot J, Goles E, Morvan M, Noual M, Sen\u00e9 S (2010) Attraction basins as gauges of the robustness against boundary conditions in biological complex systems. PLoS ONE 5:e11793","journal-title":"PLoS ONE"},{"key":"4809_CR10","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1016\/j.dam.2011.11.005","volume":"160","author":"J Demongeot","year":"2012","unstructured":"Demongeot J, Noual M, Sen\u00e9 S (2012) Combinatorics of Boolean automata circuits dynamics. Discret Appl Math 160:398\u2013415","journal-title":"Discret Appl Math"},{"key":"4809_CR11","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s11047-019-09779-x","volume":"19","author":"J Demongeot","year":"2020","unstructured":"Demongeot J, Sen\u00e9 S (2020) About block-parallel Boolean networks: a position paper. Nat Comput 19:5\u201313","journal-title":"Nat Comput"},{"key":"4809_CR12","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.resp.2010.05.005","volume":"174","author":"O Dergacheva","year":"2010","unstructured":"Dergacheva O, Griffioen KJ, Neff RA, Mendelowitz D (2010) Respiratory modulation of premotor cardiac vagal neurons in the brainstem. Respir Physiol Neurobiol 174:102\u2013110","journal-title":"Respir Physiol Neurobiol"},{"key":"4809_CR13","doi-asserted-by":"crossref","unstructured":"Doncescu A, Siegel P (2015) DNA double-strand break-based nonmonotonic logic. In: Emerging trends in computational biology, bioinformatics, and systems biology, Elsevier, pp 409\u2013427","DOI":"10.1016\/B978-0-12-802508-6.00022-3"},{"key":"4809_CR14","unstructured":"Doncescu A, Siegel P, Le, T (2014) Representation and efficient algorithms for the study of cell signaling pathways. In: Proceedings of ICAI\u201914. IEEE Computer Society, pp 504\u2013510"},{"key":"4809_CR15","unstructured":"Inoue K (2011) Logic programming for boolean networks IJCAI\u201911: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, pp 924\u2013930"},{"key":"4809_CR16","doi-asserted-by":"publisher","first-page":"14796","DOI":"10.1073\/pnas.2036429100","volume":"100","author":"SA Kauffman","year":"2003","unstructured":"Kauffman SA, Peterson C, Samuelsson B, Troein C (2003) Random Boolean network models and the yeast transcriptional network. PNAS 100:14796\u201314799","journal-title":"PNAS"},{"key":"4809_CR17","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1002\/malq.19630090502","volume":"9","author":"SA Kripke","year":"1963","unstructured":"Kripke SA (1963) Semantical analysis of modal logic I Normal modal propositional calculi. Math Log Q 9:67\u201396","journal-title":"Math Log Q"},{"key":"4809_CR18","doi-asserted-by":"publisher","first-page":"4781","DOI":"10.1073\/pnas.0305937101","volume":"101","author":"F Li","year":"2004","unstructured":"Li F, Long T, Lu Y, Ouyang Q, Tang C (2004) The yeast cell-cycle network is robustly designed. PNAS 101:4781\u20134786","journal-title":"PNAS"},{"key":"4809_CR19","doi-asserted-by":"crossref","unstructured":"Lifschitz V (1999) Action languages, answer sets, and planning. In: The logic programming paradigm: a 25-year perspective, Springer, pp 357\u2013373","DOI":"10.1007\/978-3-642-60085-2_16"},{"key":"4809_CR20","doi-asserted-by":"publisher","first-page":"1029","DOI":"10.3389\/fphys.2018.01029","volume":"9","author":"AJ Liquitaya-Montiel","year":"2018","unstructured":"Liquitaya-Montiel AJ, Mendoza L (2018) Dynamical analysis of the regulatory network controlling natural killer cells differentiation. Front Physiol 9:1029","journal-title":"Front Physiol"},{"key":"4809_CR21","doi-asserted-by":"crossref","unstructured":"Melliti T, Noual M, Regnault D, Sen\u00e9 S, Sobieraj J (2015) Asynchronous dynamics of Boolean automata double-cycles. In: Proceedings of UCNC\u201915. LNCS, vol.\u00a09252. Springer, pp 250\u2013262","DOI":"10.1007\/978-3-319-21819-9_19"},{"key":"4809_CR22","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1006\/jtbi.1998.0701","volume":"193","author":"L Mendoza","year":"1998","unstructured":"Mendoza L, Alvarez-Buylla ER (1998) Dynamics of the genetic regulatory network for Arabidopsis thaliana flower morphogenesis. J Theor Biol 193:307\u2013319","journal-title":"J Theor Biol"},{"key":"4809_CR23","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1093\/bioinformatics\/15.7.593","volume":"15","author":"L Mendoza","year":"1999","unstructured":"Mendoza L, Thieffry D, Alvarez-Buylla ER (1999) Genetic control of flower morphogenesis in Arabidopsis thaliana. Bioinformatics 15:593\u2013606","journal-title":"Bioinformatics"},{"key":"4809_CR24","doi-asserted-by":"crossref","unstructured":"Milano M (2000) Andrea Roli : Solving the Satisfiability Problem Through Boolean Networks. Book Chapter published 2000 in AIIA 99: Advances in Artificial Intelligence, pp 72\u201383","DOI":"10.1007\/3-540-46238-4_7"},{"key":"4809_CR25","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","volume":"13","author":"R Reiter","year":"1980","unstructured":"Reiter R (1980) A logic for default reasoning. Artif Intell 13:81\u2013132","journal-title":"Artif Intell"},{"key":"4809_CR26","doi-asserted-by":"publisher","first-page":"ii172","DOI":"10.1093\/bioinformatics\/btg1075","volume":"19","author":"E Remy","year":"2003","unstructured":"Remy E, Moss\u00e9 B, Chaouyia C, Thieffry D (2003) A description of dynamical graphs associated to elementary regulatory circuits. Bioinformatics 19:ii172\u2013ii178","journal-title":"Bioinformatics"},{"key":"4809_CR27","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.aam.2007.11.003","volume":"41","author":"E Remy","year":"2008","unstructured":"Remy E, Ruet P, Thieffry D (2008) Graphic requirement for multistability and attractive cycles in a Boolean dynamical framework. Adv Appl Math 41:335\u2013350","journal-title":"Adv Appl Math"},{"key":"4809_CR28","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/j.aam.2009.11.011","volume":"44","author":"A Richard","year":"2010","unstructured":"Richard A (2010) Negative circuits and sustained oscillations in asynchronous automata networks. Adv Appl Math 44:378\u2013392","journal-title":"Adv Appl Math"},{"key":"4809_CR29","doi-asserted-by":"publisher","first-page":"2403","DOI":"10.1016\/j.dam.2007.04.019","volume":"155","author":"A Richard","year":"2007","unstructured":"Richard A, Comet JP (2007) Necessary conditions for multistationarity in discrete dynamical systems. Discret Appl Math 155:2403\u20132413","journal-title":"Discret Appl Math"},{"key":"4809_CR30","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/0024-3795(80)90251-7","volume":"29","author":"F Robert","year":"1980","unstructured":"Robert F (1980) It\u00e9rations sur des ensembles finis et automates cellulaires contractants. Linear Algebra Appl 29:393\u2013412","journal-title":"Linear Algebra Appl"},{"key":"4809_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61607-5","volume-title":"Discrete iterations: a metric study","author":"F Robert","year":"1986","unstructured":"Robert F (1986) Discrete iterations: a metric study. Springer, Berlin"},{"key":"4809_CR32","doi-asserted-by":"publisher","first-page":"R198","DOI":"10.1016\/S0960-9822(03)00124-6","volume":"13","author":"T Roenneberg","year":"2003","unstructured":"Roenneberg T, Merrow M (2003) The network of time: understanding the molecular circadian system. Curr Biol 13:R198\u2013R207","journal-title":"Curr Biol"},{"issue":"18","key":"4809_CR33","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1016\/j.csbj.2020.03.001","volume":"10","author":"JD Schwab","year":"2020","unstructured":"Schwab JD, K\u00fchlwein SD, Ikonomi N, K\u00fchl M, Kestler HA (2020) Concepts in Boolean network modeling: what do they all mean? Comput Struct Biotechnol J 10(18):571\u2013582. https:\/\/doi.org\/10.1016\/j.csbj.2020.03.001","journal-title":"Comput Struct Biotechnol J"},{"key":"4809_CR34","first-page":"89","volume":"21","author":"C Schwind","year":"1994","unstructured":"Schwind C, Siegel P (1994) A modal logic for hypothesis theory. Fund Inform 21:89\u2013101","journal-title":"Fund Inform"},{"key":"4809_CR35","doi-asserted-by":"publisher","first-page":"1778","DOI":"10.1109\/JPROC.2002.804686","volume":"90","author":"I Shmulevich","year":"2002","unstructured":"Shmulevich I, Dougherty ER, Zhang W (2002) From Boolean to probabilistic Boolean networks as models of genetic regulatory networks. Proc IEEE 90:1778\u20131792","journal-title":"Proc IEEE"},{"key":"4809_CR36","unstructured":"Siegel P, Doncescu A, Risch V, Sen\u00e9 S (2018) Towards a Boolean dynamical system representation into a nonmonotonic modal logic. In: Proceedings of NMR\u201918. pp 53\u201362"},{"key":"4809_CR37","first-page":"277","volume":"57","author":"D Thieffry","year":"1995","unstructured":"Thieffry D, Thomas R (1995) Dynamical behaviour of biological regulatory networks - II. Immunity control in bacteriophage Lambda. Bull Math Biol 57:277\u2013297","journal-title":"Bull Math Biol"},{"key":"4809_CR38","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/0022-5193(73)90247-6","volume":"42","author":"R Thomas","year":"1973","unstructured":"Thomas R (1973) Boolean formalization of genetic control circuits. J Theor Biol 42:563\u2013585","journal-title":"J Theor Biol"},{"key":"4809_CR39","doi-asserted-by":"crossref","unstructured":"Thomas R (1981) On the relation between the logical structure of systems and their ability to generate multiple steady states or sustained oscillations. In: Numerical methods in the study of critical phenomena, Springer, pp 180\u2013193.","DOI":"10.1007\/978-3-642-81703-8_24"},{"issue":"111025","key":"4809_CR40","first-page":"7","volume":"538","author":"J Zobolas","year":"2022","unstructured":"Zobolas J, Monteiro P, Kuiper M, Flobak A (2022) Boolean function metrics can assist modelers to check and choose logical rules. J Theor Biol 538(111025):7","journal-title":"J Theor Biol"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04809-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-022-04809-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04809-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T10:29:35Z","timestamp":1674815375000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-022-04809-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,28]]},"references-count":40,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["4809"],"URL":"https:\/\/doi.org\/10.1007\/s11227-022-04809-5","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,28]]},"assertion":[{"value":"29 August 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}]}}