{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T00:05:20Z","timestamp":1772755520583,"version":"3.50.1"},"reference-count":11,"publisher":"Oxford University Press (OUP)","issue":"21","license":[{"start":{"date-parts":[[2022,9,14]],"date-time":"2022-09-14T00:00:00Z","timestamp":1663113600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"name":"Grant Agency of Masaryk University","award":["MUNI\/G\/1771\/2020"],"award-info":[{"award-number":["MUNI\/G\/1771\/2020"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,10,31]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:sec>\n                  <jats:title>Summary<\/jats:title>\n                  <jats:p>AEON.py is a Python library for the analysis of the long-term behaviour in very large asynchronous Boolean networks. It provides significant computational improvements over the state-of-the-art methods for attractor detection. Furthermore, it admits the analysis of partially specified Boolean networks with uncertain update functions. It also includes techniques for identifying viable source-target control strategies and the assessment of their robustness with respect to parameter perturbations.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Availability and implementation<\/jats:title>\n                  <jats:p>All relevant results are available in Supplementary Materials. The tool is accessible through https:\/\/github.com\/sybila\/biodivine-aeon-py.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Supplementary information<\/jats:title>\n                  <jats:p>Supplementary data are available at Bioinformatics online.<\/jats:p>\n               <\/jats:sec>","DOI":"10.1093\/bioinformatics\/btac624","type":"journal-article","created":{"date-parts":[[2022,9,13]],"date-time":"2022-09-13T12:40:47Z","timestamp":1663072847000},"page":"4978-4980","source":"Crossref","is-referenced-by-count":27,"title":["AEON.py: Python library for attractor analysis in asynchronous Boolean networks"],"prefix":"10.1093","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0164-4046","authenticated-orcid":false,"given":"Nikola","family":"Bene\u0161","sequence":"first","affiliation":[{"name":"Faculty of Informatics, Masaryk University , Brno 602 00, Czech Republic"}]},{"given":"Lubo\u0161","family":"Brim","sequence":"additional","affiliation":[{"name":"Faculty of Informatics, Masaryk University , Brno 602 00, Czech Republic"}]},{"given":"Ond\u0159ej","family":"Huvar","sequence":"additional","affiliation":[{"name":"Faculty of Informatics, Masaryk University , Brno 602 00, Czech Republic"}]},{"given":"Samuel","family":"Pastva","sequence":"additional","affiliation":[{"name":"Faculty of Informatics, Masaryk University , Brno 602 00, Czech Republic"}]},{"given":"David","family":"\u0160afr\u00e1nek","sequence":"additional","affiliation":[{"name":"Faculty of Informatics, Masaryk University , Brno 602 00, Czech Republic"}]},{"given":"Eva","family":"\u0160mij\u00e1kov\u00e1","sequence":"additional","affiliation":[{"name":"Faculty of Informatics, Masaryk University , Brno 602 00, Czech Republic"}]}],"member":"286","published-online":{"date-parts":[[2022,9,14]]},"reference":[{"key":"2022103112485957500_btac624-B1","first-page":"353","author":"Bene\u0161","year":"2019"},{"key":"2022103112485957500_btac624-B2","first-page":"569","author":"Bene\u0161","year":"2020"},{"key":"2022103112485957500_btac624-B3","first-page":"505","author":"Bene\u0161","year":"2021"},{"key":"2022103112485957500_btac624-B4","author":"Brim","year":"2022"},{"key":"2022103112485957500_btac624-B5","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","article-title":"Graph-based algorithms for boolean function manipulation","volume":"C-35","author":"Bryant","year":"1986","journal-title":"IEEE Trans. Comput"},{"key":"2022103112485957500_btac624-B6","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1007\/s10009-005-0188-7","article-title":"The saturation algorithm for symbolic state-space exploration","volume":"8","author":"Ciardo","year":"2006","journal-title":"Int. J. Softw. Tools Technol. Transf"},{"key":"2022103112485957500_btac624-B7","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/TCBB.2018.2850901","article-title":"Taming asynchrony for attractor detection in large boolean networks","volume":"16","author":"Mizera","year":"2018","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform"},{"key":"2022103112485957500_btac624-B8","doi-asserted-by":"crossref","first-page":"1154","DOI":"10.1093\/bioinformatics\/btv013","article-title":"Cooperative development of logical modelling standards and tools with colomoto","volume":"31","author":"Naldi","year":"2015","journal-title":"Bioinformatics"},{"key":"2022103112485957500_btac624-B9","doi-asserted-by":"crossref","first-page":"1465","DOI":"10.1093\/bioinformatics\/btab825","article-title":"Pystablemotifs: python library for attractor identification and control in boolean networks","volume":"38","author":"Rozum","year":"2021","journal-title":"Bioinformatics"},{"key":"2022103112485957500_btac624-B10","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1093\/bioinformatics\/btaa752","article-title":"CABEAN: a software for the control of asynchronous Boolean networks","volume":"37","author":"Su","year":"2020","journal-title":"Bioinformatics"},{"key":"2022103112485957500_btac624-B11","author":"Van Trinh","year":"2020"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/advance-article-pdf\/doi\/10.1093\/bioinformatics\/btac624\/45947870\/btac624.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/38\/21\/4978\/46697992\/btac624.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/38\/21\/4978\/46697992\/btac624.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,31]],"date-time":"2022-10-31T12:50:46Z","timestamp":1667220646000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/38\/21\/4978\/6697883"}},"subtitle":[],"editor":[{"given":"Alfonso","family":"Valencia","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2022,9,14]]},"references-count":11,"journal-issue":{"issue":"21","published-online":{"date-parts":[[2022,9,14]]},"published-print":{"date-parts":[[2022,10,31]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btac624","relation":{},"ISSN":["1367-4803","1367-4811"],"issn-type":[{"value":"1367-4803","type":"print"},{"value":"1367-4811","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2022,11,1]]},"published":{"date-parts":[[2022,9,14]]}}}