{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:56:24Z","timestamp":1743029784124,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031426964"},{"type":"electronic","value":"9783031426971"}],"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_12","type":"book-chapter","created":{"date-parts":[[2023,9,8]],"date-time":"2023-09-08T09:02:29Z","timestamp":1694163749000},"page":"175-183","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["SAF: SAT-Based Attractor Finder in\u00a0Asynchronous Automata Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5897-9192","authenticated-orcid":false,"given":"Takehide","family":"Soh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5443-0506","authenticated-orcid":false,"given":"Morgan","family":"Magnin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3221-9923","authenticated-orcid":false,"given":"Daniel","family":"Le Berre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5388-727X","authenticated-orcid":false,"given":"Mutsunori","family":"Banbara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5466-1010","authenticated-orcid":false,"given":"Naoyuki","family":"Tamura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,9]]},"reference":[{"key":"12_CR1","unstructured":"IPASIR. https:\/\/www.cs.utexas.edu\/users\/moore\/acl2\/manuals\/current\/manual\/index-seo.php\/IPASIR____IPASIR"},{"key":"12_CR2","unstructured":"Model of Boolean network version of T-helper. https:\/\/github.com\/hklarner\/pyboolnet\/tree\/master\/pyboolnet\/repository\/jaoude_thdiff"},{"key":"12_CR3","unstructured":"Model of T-LGL used in Boolean netrwork experiments. https:\/\/github.com\/TakehideSoh\/SAF-Evaluation\/blob\/main\/exp-boolean-network\/benchmark\/2176_T-LGL_Survival_Network_2008.booleannet.bnet"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Abdallah, E.B., Folschette, M., Roux, O.F., Magnin, M.: ASP-based method for the enumeration of attractors in non-deterministic synchronous and asynchronous multi-valued networks. Algorithms Mol. Biol. 12(1), 20:1\u201320:23 (2017)","DOI":"10.1186\/s13015-017-0111-2"},{"key":"12_CR5","first-page":"86","volume":"2","author":"W Abou-Jaoud\u00e9","year":"2015","unstructured":"Abou-Jaoud\u00e9, W., et al.: Model checking to assess t-helper cell plasticity. Front. Bioeng. Biotechnol. 2, 86 (2015)","journal-title":"Front. Bioeng. Biotechnol."},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Ben Abdallah, E., Folschette, M., Magnin, M.: Analyzing long-term dynamics of biological networks with answer set programming. In: Systems Biology Modelling and Analysis: Formal Bioinformatics Methods and Tools, pp. 251\u2013303 (2022)","DOI":"10.1002\/9781119716600.ch7"},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13015-017-0111-2","volume":"12","author":"E Ben Abdallah","year":"2017","unstructured":"Ben Abdallah, E., Folschette, M., Roux, O., Magnin, M.: Asp-based method for the enumeration of attractors in non-deterministic synchronous and asynchronous multi-valued networks. Algorithms Mol. Biol. 12(1), 1\u201323 (2017)","journal-title":"Algorithms Mol. Biol."},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Benes, N., Brim, L., Huvar, O., Pastva, S., Safr\u00e1nek, D., Smij\u00e1kov\u00e1, E.: Aeon.py: Python library for attractor analysis in asynchronous Boolean networks. Bioinformatics 38(21), 4978\u20134980 (2022)","DOI":"10.1093\/bioinformatics\/btac624"},{"key":"12_CR9","unstructured":"Biere, A., Fazekas, K., Fleury, M., Heisinger, M.: CaDiCaL, Kissat, Paracooba, Plingeling and Treengeling entering the SAT Competition 2020. In: Balyo, T., Froleyks, N., Heule, M., Iser, M., J\u00e4rvisalo, M., Suda, M. (eds.) Proceedings of SAT Competition 2020 - Solver and Benchmark Descriptions. Department of Computer Science Report Series B, vol. B-2020-1, pp. 51\u201353. University of Helsinki (2020)"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability, 2nd edn, Frontiers in Artificial Intelligence and Applications, vol. 336. IOS Press (2021)","DOI":"10.3233\/FAIA336"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1186\/1752-0509-7-135","volume":"7","author":"C Chaouiya","year":"2013","unstructured":"Chaouiya, C., et al.: SBML qualitative models: a model representation format and infrastructure to foster interactions between qualitative modelling formalisms and tools. BMC Syst. Biol. 7, 135 (2013)","journal-title":"BMC Syst. Biol."},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.tcs.2015.08.040","volume":"608","author":"M Folschette","year":"2015","unstructured":"Folschette, M., Paulev\u00e9, L., Magnin, M., Roux, O.: Sufficient conditions for reachability in automata networks with priorities. Theor. Comput. Sci. 608, 66\u201383 (2015)","journal-title":"Theor. Comput. Sci."},{"issue":"17","key":"12_CR13","doi-asserted-by":"publisher","first-page":"1917","DOI":"10.1093\/bioinformatics\/btn336","volume":"24","author":"A Garg","year":"2008","unstructured":"Garg, A., Cara, A.D., Xenarios, I., Mendoza, L., Micheli, G.D.: Synchronous versus asynchronous modeling of gene regulatory networks. Bioinformatics 24(17), 1917\u20131925 (2008)","journal-title":"Bioinformatics"},{"issue":"5","key":"12_CR14","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)","journal-title":"Bioinformatics"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Le Berre, D., Parrain, A.: The Sat4j library, release 2.2. J. Satisfiabil. Boolean Model. Comput. 7(2\u20133), 59\u201364 (2010)","DOI":"10.3233\/SAT190075"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-319-45177-0_16","volume-title":"Computational Methods in Systems Biology","author":"L Paulev\u00e9","year":"2016","unstructured":"Paulev\u00e9, L.: Goal-oriented reduction of automata networks. In: Bartocci, E., Lio, P., Paoletti, N. (eds.) CMSB 2016. LNCS, vol. 9859, pp. 252\u2013272. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45177-0_16"},{"key":"12_CR17","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"},{"issue":"5","key":"12_CR18","doi-asserted-by":"publisher","first-page":"1465","DOI":"10.1093\/bioinformatics\/btab825","volume":"38","author":"JC Rozum","year":"2022","unstructured":"Rozum, J.C., Deritei, D., Park, K.H., Za\u00f1udo, J.G.T., Albert, R.: pystablemotifs: Python library for attractor identification and control in Boolean networks. Bioinformatics 38(5), 1465\u20131466 (2022)","journal-title":"Bioinformatics"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Soh, T., Magnin, M., Berre, D.L., Banbara, M., Tamura, N.: Sat-based method for finding attractors in asynchronous multi-valued networks. In: Ali, H., Deng, N., Fred, A.L.N., Gamboa, H. (eds.) Proceedings of the 16th International Joint Conference on Biomedical Engineering Systems and Technologies, BIOSTEC 2023, Volume 3: BIOINFORMATICS, pp. 163\u2013174. SCITEPRESS (2023)","DOI":"10.5220\/0011675100003414"},{"issue":"6","key":"12_CR20","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1093\/bioinformatics\/btaa752","volume":"37","author":"C Su","year":"2021","unstructured":"Su, C., Pang, J.: Cabean: a software for the control of asynchronous Boolean networks. Bioinformaics 37(6), 879\u2013881 (2021)","journal-title":"Bioinformaics"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Toda, T., Soh, T.: Implementing efficient all solutions SAT solvers. ACM J. Exp. Algorithmics 21(1), 1.12:1\u20131.12:44 (2016)","DOI":"10.1145\/2975585"}],"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_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,8]],"date-time":"2023-09-08T09:04:02Z","timestamp":1694163842000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-42697-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031426964","9783031426971"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-42697-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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)"}}]}}