{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:28:48Z","timestamp":1742966928847,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031150333"},{"type":"electronic","value":"9783031150340"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15034-0_16","type":"book-chapter","created":{"date-parts":[[2022,8,18]],"date-time":"2022-08-18T19:03:08Z","timestamp":1660849388000},"page":"294-301","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Extension of\u00a0ERODE to\u00a0Reduce Boolean Networks By Backward Boolean Equivalence"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3203-0410","authenticated-orcid":false,"given":"Georgios","family":"Argyris","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7405-0818","authenticated-orcid":false,"given":"Alberto Lluch","family":"Lafuente","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6018-5989","authenticated-orcid":false,"given":"Mirco","family":"Tribastone","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6186-8669","authenticated-orcid":false,"given":"Max","family":"Tschaikowski","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2606-7241","authenticated-orcid":false,"given":"Andrea","family":"Vandin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,19]]},"reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-85633-5_1","volume-title":"Computational Methods in Systems Biology","author":"G Argyris","year":"2021","unstructured":"Argyris, G., Lluch Lafuente, A., Tribastone, M., Tschaikowski, M., Vandin, A.: Reducing Boolean networks with\u00a0backward Boolean equivalence. In: Cinquemani, E., Paulev\u00e9, L. (eds.) CMSB 2021. LNCS, vol. 12881, pp. 1\u201318. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-85633-5_1"},{"issue":"1","key":"16_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1752-0509-4-134","volume":"4","author":"E Azpeitia","year":"2010","unstructured":"Azpeitia, E., Ben\u00edtez, M., Vega, I., Villarreal, C., Alvarez-Buylla, E.R.: Single-cell and coupled GRN models of cell patterning in the Arabidopsis thaliana root stem cell niche. BMC Syst. Biol. 4(1), 1\u201319 (2010)","journal-title":"BMC Syst. Biol."},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-662-54580-5_19","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L Cardelli","year":"2017","unstructured":"Cardelli, L., Tribastone, M., Tschaikowski, M., Vandin, A.: ERODE: a tool for the evaluation and reduction of ordinary differential equations. In: Legay, A., Margaria, T. (eds.) TACAS 2017. LNCS, vol. 10206, pp. 310\u2013328. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54580-5_19"},{"issue":"1","key":"16_CR4","doi-asserted-by":"publisher","first-page":"1","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(1), 1\u201315 (2013)","journal-title":"BMC Syst. Biol."},{"key":"16_CR5","doi-asserted-by":"publisher","unstructured":"Chaouiya, C., Naldi, A., Thieffry, D.: Logical modelling of gene regulatory networks with GINsim. In: van Helden, J., Toussaint, A., Thieffry, D. (eds.) Bacterial Molecular Networks. Methods in Molecular Biology, vol. 804, pp. 463\u2013479. Springer, New York (2012). https:\/\/doi.org\/10.1007\/978-1-61779-361-5_23","DOI":"10.1007\/978-1-61779-361-5_23"},{"issue":"5","key":"16_CR6","doi-asserted-by":"publisher","first-page":"1052","DOI":"10.1016\/j.devcel.2012.03.003","volume":"22","author":"M Coolen","year":"2012","unstructured":"Coolen, M., Thieffry, D., Drivenes, \u00d8., Becker, T.S., Bally-Cuif, L.: miR-9 controls the timing of neurogenesis through the direct inhibition of antagonistic factors. Dev. Cell 22(5), 1052\u20131064 (2012)","journal-title":"Dev. Cell"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"issue":"3","key":"16_CR8","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/0022-5193(69)90015-0","volume":"22","author":"S Kauffman","year":"1969","unstructured":"Kauffman, S.: Metabolic stability and epigenesis in randomly constructed genetic nets. J. Theor. Biol. 22(3), 437\u2013467 (1969)","journal-title":"J. Theor. Biol."},{"issue":"D1","key":"16_CR9","doi-asserted-by":"publisher","first-page":"D407","DOI":"10.1093\/nar\/gkz1055","volume":"48","author":"RS Malik-Sheriff","year":"2020","unstructured":"Malik-Sheriff, R.S., et al.: BioModels\u201315 years of sharing computational models in life science. Nucleic Acids Res. 48(D1), D407\u2013D415 (2020). https:\/\/doi.org\/10.1093\/nar\/gkz1055","journal-title":"Nucleic Acids Res."},{"issue":"10","key":"16_CR10","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)","journal-title":"Bioinformatics"},{"key":"16_CR11","doi-asserted-by":"publisher","unstructured":"Naldi, A., Berenguier, D., Faur\u00e9, A., Lopez, F., Thieffry, D., Chaouiya, C.: Logical modelling of regulatory networks with GINsim 2.3. Biosystems 97(2), 134\u2013139 (2009). https:\/\/doi.org\/10.1016\/j.biosystems.2009.04.008, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0303264709000665","DOI":"10.1016\/j.biosystems.2009.04.008"},{"key":"16_CR12","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)","journal-title":"Front. Physiol."},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-642-33636-2_17","volume-title":"Computational Methods in Systems Biology","author":"A Naldi","year":"2012","unstructured":"Naldi, A., Monteiro, P.T., Chaouiya, C.: Efficient handling of large signalling-regulatory networks by focusing on their core control. In: Gilbert, D., Heiner, M. (eds.) CMSB 2012. LNCS, pp. 288\u2013306. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33636-2_17"},{"issue":"7","key":"16_CR14","doi-asserted-by":"publisher","first-page":"1154","DOI":"10.1093\/bioinformatics\/btv013","volume":"31","author":"A Naldi","year":"2015","unstructured":"Naldi, A., et al.: Cooperative development of logical modelling standards and tools with CoLoMoTo. Bioinformatics 31(7), 1154\u20131159 (2015)","journal-title":"Bioinformatics"},{"issue":"21","key":"16_CR15","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)","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"16_CR16","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput. 16(6), 973\u2013989 (1987)","journal-title":"SIAM J. Comput."},{"key":"16_CR17","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. Theor. Biol. 289, 167\u2013172 (2011)","journal-title":"J. Theor. Biol."}],"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-15034-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,6]],"date-time":"2022-09-06T23:04:43Z","timestamp":1662505483000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15034-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031150333","9783031150340"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15034-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"19 August 2022","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":"Bucharest","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Romania","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cmsb2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fmi.unibuc.ro\/en\/cmsb-2022\/","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":"43","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":"13","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":"0","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":"30% - 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","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":"2","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)"}}]}}