{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T21:27:49Z","timestamp":1775078869874,"version":"3.50.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031426964","type":"print"},{"value":"9783031426971","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-42697-1_14","type":"book-chapter","created":{"date-parts":[[2023,9,8]],"date-time":"2023-09-08T09:02:29Z","timestamp":1694163749000},"page":"202-219","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Attractor Identification in\u00a0Asynchronous Boolean Dynamics with\u00a0Network Reduction"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5182-4216","authenticated-orcid":false,"given":"Elisa","family":"Tonello","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7219-2027","authenticated-orcid":false,"given":"Lo\u00efc","family":"Paulev\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,9]]},"reference":[{"issue":"21","key":"14_CR1","doi-asserted-by":"publisher","first-page":"4978","DOI":"10.1093\/bioinformatics\/btac624","volume":"38","author":"N Bene\u0161","year":"2022","unstructured":"Bene\u0161, N., et al.: AEON.py: python library for attractor analysis in asynchronous Boolean networks. Bioinformatics 38(21), 4978\u20134980 (2022). https:\/\/doi.org\/10.1093\/bioinformatics\/btac624","journal-title":"Bioinformatics"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-030-81685-8_24","volume-title":"Computer Aided Verification","author":"N Bene\u0161","year":"2021","unstructured":"Bene\u0161, N., Brim, L., Pastva, S., \u0160afr\u00e1nek, D.: Computing bottom SCCs symbolically using transition guided reduction. In: Silva, A., Leino, K.R.M. (eds.) CAV 2021. LNCS, vol. 12759, pp. 505\u2013528. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81685-8_24"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"130","DOI":"10.3389\/fbioe.2015.00130","volume":"3","author":"H Klarner","year":"2015","unstructured":"Klarner, H., Siebert, H.: Approximating attractors of Boolean networks by iterative CTL model checking. Front. Bioeng. Biotechnol. 3, 130 (2015). https:\/\/doi.org\/10.3389\/fbioe.2015.00130","journal-title":"Front. Bioeng. Biotechnol."},{"issue":"5","key":"14_CR4","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1093\/bioinformatics\/btw682","volume":"33","author":"H Klarner","year":"2017","unstructured":"Klarner, H., Streck, A., Siebert, H.: PyBoolNet: a python package for the generation, analysis and visualization of Boolean networks. Bioinformatics 33(5), 770\u2013772 (2017). https:\/\/doi.org\/10.1093\/bioinformatics\/btw682","journal-title":"Bioinformatics"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"e72626","DOI":"10.7554\/elife.72626","volume":"11","author":"A Montagud","year":"2022","unstructured":"Montagud, A., et al.: Patient-specific Boolean models of signalling networks guide personalised treatments. eLife 11, e72626 (2022). https:\/\/doi.org\/10.7554\/elife.72626","journal-title":"eLife"},{"key":"14_CR6","doi-asserted-by":"publisher","unstructured":"Moon, K., Lee, K., Paulev\u00e9, L.: Computational Complexity of Minimal Trap Spaces in Boolean Networks. arXiv preprint arXiv:2212.12756 (2022). https:\/\/doi.org\/10.48550\/arXiv.2212.12756","DOI":"10.48550\/arXiv.2212.12756"},{"key":"14_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.csbj.2022.05.027","author":"T Mori","year":"2022","unstructured":"Mori, T., Akutsu, T.: Attractor detection and enumeration algorithms for Boolean networks. Comput. Struct. Biotechnol. J. (2022). https:\/\/doi.org\/10.1016\/j.csbj.2022.05.027","journal-title":"Comput. Struct. Biotechnol. J."},{"issue":"10","key":"14_CR8","doi-asserted-by":"publisher","first-page":"1378","DOI":"10.1093\/bioinformatics\/btq124","volume":"26","author":"C M\u00fcssel","year":"2010","unstructured":"M\u00fcssel, C., Hopfensitz, M., Kestler, H.A.: BoolNet-an R package for generation, reconstruction and analysis of Boolean networks. Bioinformatics 26(10), 1378\u20131380 (2010). https:\/\/doi.org\/10.1093\/bioinformatics\/btq124","journal-title":"Bioinformatics"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"680","DOI":"10.3389\/fphys.2018.00680","volume":"9","author":"A Naldi","year":"2018","unstructured":"Naldi, A., et al.: The CoLoMoTo interactive notebook: accessible and reproducible computational analyses for qualitative biological networks. Front. Physiol. 9, 680 (2018). https:\/\/doi.org\/10.3389\/fphys.2018.00680","journal-title":"Front. Physiol."},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-642-03845-7_18","volume-title":"Computational Methods in Systems Biology","author":"A Naldi","year":"2009","unstructured":"Naldi, A., Remy, E., Thieffry, D., Chaouiya, C.: A reduction of logical regulatory graphs preserving essential dynamical properties. In: Degano, P., Gorrieri, R. (eds.) CMSB 2009. LNCS, vol. 5688, pp. 266\u2013280. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03845-7_18"},{"issue":"21","key":"14_CR11","doi-asserted-by":"publisher","first-page":"2207","DOI":"10.1016\/j.tcs.2010.10.021","volume":"412","author":"A Naldi","year":"2011","unstructured":"Naldi, A., Remy, E., Thieffry, D., Chaouiya, C.: Dynamically consistent reduction of logical regulatory graphs. Theoret. Comput. Sci. 412(21), 2207\u20132218 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2010.10.021","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR12","doi-asserted-by":"publisher","unstructured":"Naldi, A., Richard, A., Tonello, E.: Linear cuts in Boolean networks. arXiv preprint arXiv:2203.01620 (2022). https:\/\/doi.org\/10.48550\/arXiv.2203.01620","DOI":"10.48550\/arXiv.2203.01620"},{"key":"14_CR13","doi-asserted-by":"publisher","unstructured":"Pastva, S., Safranek, D., Benes, N., Brim, L., Henzinger, T.: Repository of logically consistent real-world Boolean network models. bioRxiv, pp. 2023\u20132306 (2023). https:\/\/doi.org\/10.1101\/2023.06.12.544361","DOI":"10.1101\/2023.06.12.544361"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-319-67471-1_20","volume-title":"Computational Methods in Systems Biology","author":"L Paulev\u00e9","year":"2017","unstructured":"Paulev\u00e9, L.: Pint: a static analyzer for transient dynamics of qualitative networks with IPython interface. In: Feret, J., Koeppl, H. (eds.) CMSB 2017. LNCS, vol. 10545, pp. 309\u2013316. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67471-1_20"},{"key":"14_CR15","doi-asserted-by":"publisher","unstructured":"Paulev\u00e9, L., Sen\u00e9, S.: Boolean networks and their dynamics: the impact of updates. In: Systems Biology Modelling and Analysis: Formal Bioinformatics Methods and Tools. Wiley (2022). https:\/\/doi.org\/10.1002\/9781119716600.ch6","DOI":"10.1002\/9781119716600.ch6"},{"key":"14_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.113706","volume":"947","author":"A Richard","year":"2023","unstructured":"Richard, A., Tonello, E.: Attractor separation and signed cycles in asynchronous Boolean networks. Theoret. Comput. Sci. 947, 113706 (2023). https:\/\/doi.org\/10.1016\/j.tcs.2023.113706","journal-title":"Theoret. Comput. Sci."},{"issue":"29","key":"14_CR17","doi-asserted-by":"publisher","first-page":"eabf8124","DOI":"10.1126\/sciadv.abf8124","volume":"7","author":"JC Rozum","year":"2021","unstructured":"Rozum, J.C., G\u00f3mez Tejeda Za\u00f1udo, J., Gan, X., Deritei, D., Albert, R.: Parity and time reversal elucidate both decision-making in empirical models and attractor scaling in critical Boolean networks. Sci. Adv. 7(29), eabf8124 (2021). https:\/\/doi.org\/10.1126\/sciadv.abf8124","journal-title":"Sci. Adv."},{"issue":"4","key":"14_CR18","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1016\/j.jtbi.2010.07.022","volume":"266","author":"A Saadatpour","year":"2010","unstructured":"Saadatpour, A., Albert, I., Albert, R.: Attractor analysis of asynchronous Boolean models of signal transduction networks. J. Theoret. Biol. 266(4), 641\u2013656 (2010). https:\/\/doi.org\/10.1016\/j.jtbi.2010.07.022","journal-title":"J. Theoret. Biol."},{"issue":"4","key":"14_CR19","doi-asserted-by":"publisher","first-page":"1997","DOI":"10.1137\/13090537X","volume":"12","author":"A Saadatpour","year":"2013","unstructured":"Saadatpour, A., Albert, R., Reluga, T.C.: A reduction method for Boolean network models proven to conserve attractors. SIAM J. Appl. Dyn. Syst. 12(4), 1997\u20132011 (2013). https:\/\/doi.org\/10.1137\/13090537X","journal-title":"SIAM J. Appl. Dyn. Syst."},{"key":"14_CR20","doi-asserted-by":"publisher","first-page":"5321","DOI":"10.1016\/j.csbj.2021.09.012","volume":"19","author":"JD Schwab","year":"2021","unstructured":"Schwab, J.D., Ikonomi, N., Werle, S.D., Weidner, F.M., Geiger, H., Kestler, H.A.: Reconstructing Boolean network ensembles from single-cell data for unraveling dynamics in the aging of human hematopoietic stem cells. Comput. Struct. Biotechnol. J. 19, 5321\u20135332 (2021). https:\/\/doi.org\/10.1016\/j.csbj.2021.09.012","journal-title":"Comput. Struct. Biotechnol. J."},{"key":"14_CR21","doi-asserted-by":"publisher","unstructured":"Schwieger, R., Tonello, E.: Reduction for asynchronous Boolean networks: elimination of negatively autoregulated components. arXiv preprint arXiv:2302.03108 (2023). https:\/\/doi.org\/10.48550\/arXiv.2302.03108","DOI":"10.48550\/arXiv.2302.03108"},{"issue":"14","key":"14_CR22","doi-asserted-by":"publisher","first-page":"2226","DOI":"10.1093\/bioinformatics\/btx123","volume":"33","author":"G Stoll","year":"2017","unstructured":"Stoll, G., et al.: MaBoSS: 2.0 an environment for stochastic Boolean modeling. Bioinformatics 33(14), 2226\u20132228 (2017). https:\/\/doi.org\/10.1093\/bioinformatics\/btx123","journal-title":"Bioinformatics"},{"key":"14_CR23","doi-asserted-by":"publisher","unstructured":"Trinh, V.G., Benhamou, B., Hiraishi, K., Soliman, S.: Minimal trap spaces of Logical models are maximal siphons of their Petri net encoding. In: Petre, I., P\u00e3un, A. (eds.) Computational Methods in Systems Biology, CMSB 2022. LNCS, vol. 13447, pp. 158\u2013176. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15034-0_8","DOI":"10.1007\/978-3-031-15034-0_8"},{"key":"14_CR24","doi-asserted-by":"publisher","unstructured":"Trinh, V.G., Hiraishi, K., Benhamou, B.: Computing attractors of large-scale asynchronous Boolean networks using minimal trap spaces. In: Proceedings of the 13th ACM International Conference on Bioinformatics, Computational Biology and Health Informatics, pp. 1\u201310 (2022). https:\/\/doi.org\/10.1145\/3535508.3545520","DOI":"10.1145\/3535508.3545520"},{"key":"14_CR25","doi-asserted-by":"publisher","unstructured":"Van Giang, T., Hiraishi, K.: An improved method for finding attractors of large-scale asynchronous Boolean networks. In: 2021 IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB), pp. 1\u20139. IEEE (2021). https:\/\/doi.org\/10.1109\/CIBCB49929.2021.9562947","DOI":"10.1109\/CIBCB49929.2021.9562947"},{"key":"14_CR26","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.jtbi.2011.08.042","volume":"289","author":"A Veliz-Cuba","year":"2011","unstructured":"Veliz-Cuba, A.: Reduction of Boolean network models. J. Theoret. Biol. 289, 167\u2013172 (2011). https:\/\/doi.org\/10.1016\/j.jtbi.2011.08.042","journal-title":"J. Theoret. Biol."},{"issue":"17","key":"14_CR27","doi-asserted-by":"publisher","first-page":"4603","DOI":"10.1158\/0008-5472.can-21-1208","volume":"81","author":"JGT Za\u00f1udo","year":"2021","unstructured":"Za\u00f1udo, J.G.T., et al.: Cell line-specific network models of ER+ breast cancer identify potential PI3ka inhibitor resistance mechanisms and drug combinations. Cancer Res. 81(17), 4603\u20134617 (2021). https:\/\/doi.org\/10.1158\/0008-5472.can-21-1208","journal-title":"Cancer Res."},{"key":"14_CR28","doi-asserted-by":"publisher","unstructured":"Za\u00f1udo, J.G., Albert, R.: An effective network reduction approach to find the dynamical repertoire of discrete dynamic networks. Chaos Interdiscipl. J. Nonlinear Sci. 23(2), 025111 (2013). https:\/\/doi.org\/10.1063\/1.4809777","DOI":"10.1063\/1.4809777"}],"container-title":["Lecture Notes in Computer Science","Computational Methods in Systems Biology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-42697-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,8]],"date-time":"2023-09-08T09:04:14Z","timestamp":1694163854000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-42697-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031426964","9783031426971"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-42697-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"9 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CMSB","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Methods in Systems Biology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg City","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cmsb2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cmsb2023.uni.lu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.72 (regular), 3 (tool)","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}