{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T23:44:13Z","timestamp":1773272653106,"version":"3.50.1"},"reference-count":75,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["851093 (SAFEBIO)"],"award-info":[{"award-number":["851093 (SAFEBIO)"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002341","name":"Academy of Finland","doi-asserted-by":"publisher","award":["322595"],"award-info":[{"award-number":["322595"]}],"id":[{"id":"10.13039\/501100002341","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002341","name":"Academy of Finland","doi-asserted-by":"publisher","award":["328877"],"award-info":[{"award-number":["328877"]}],"id":[{"id":"10.13039\/501100002341","id-type":"DOI","asserted-by":"publisher"}]},{"name":"U.S. Fulbright Program"},{"DOI":"10.13039\/501100019177","name":"Fulbright Suomi -s\u00e4\u00e4ti\u00f6","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100019177","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100023750","name":"Helsinki Institute for Information Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100023750","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DBI-1759522"],"award-info":[{"award-number":["DBI-1759522"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Comput. Biol. and Bioinf."],"published-print":{"date-parts":[[2022,11,1]]},"DOI":"10.1109\/tcbb.2021.3131203","type":"journal-article","created":{"date-parts":[[2021,11,30]],"date-time":"2021-11-30T23:31:59Z","timestamp":1638315119000},"page":"3673-3684","source":"Crossref","is-referenced-by-count":6,"title":["Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG"],"prefix":"10.1109","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0235-6951","authenticated-orcid":false,"given":"Manuel","family":"C\u00e1ceres","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Helsinki, Helsinki, Finland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7151-2124","authenticated-orcid":false,"given":"Brendan","family":"Mumey","sequence":"additional","affiliation":[{"name":"School of Computer Science, Montana State University, Bozeman, MT, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6708-5112","authenticated-orcid":false,"given":"Edin","family":"Husi\u0107","sequence":"additional","affiliation":[{"name":"Department of Mathematics, London School of Economics and Political Science, London, U.K."}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2387-0952","authenticated-orcid":false,"given":"Romeo","family":"Rizzi","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Verona, Verona, Italy"}]},{"given":"Massimo","family":"Cairo","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Helsinki, Helsinki, Finland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7378-2320","authenticated-orcid":false,"given":"Kristoffer","family":"Sahlin","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Science for Life Laboratory, Stockholm University, Stockholm, Sweden"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5747-8350","authenticated-orcid":false,"given":"Alexandru I.","family":"Tomescu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Helsinki, Helsinki, Finland"}]}],"member":"263","reference":[{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1101\/gr.131383.111"},{"key":"ref72","volume":"48","author":"dantzig","year":"1998","journal-title":"Linear Programming and Extensions"},{"key":"ref71","article-title":"The minimum cost flow problem and the network simplex method","author":"damian","year":"1991"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2011.06.003"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1038\/s41592-019-0669-3"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2019.00055"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btv033"},{"key":"ref75","first-page":"257","article-title":"A linear-time parameterized algorithm for computing the width of a DAG","author":"c\u00e1ceres","year":"2021","journal-title":"Proc Int Workshop Graph-Theor Concepts Comput Sci"},{"key":"ref33","author":"bang-jensen","year":"2008","journal-title":"Digraphs Theory Algorithms and Applications"},{"key":"ref32","first-page":"701","article-title":"Note on Dilworthâs decomposition theorem for partially ordered sets","volume":"7","author":"fulkerson","year":"1956","journal-title":"Proc Amer Math Soc"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.2307\/1969503"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btz443"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/BF01188580"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1186\/s13059-020-02151-8"},{"key":"ref35","article-title":"Sparsifying, shrinking and splicing for minimum path cover in parameterized linear time","author":"c\u00e1ceres","year":"2021"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3301312"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1186\/s13059-014-0501-4"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1038\/nmeth.2714"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.4020"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-12-119"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2019.0286"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1000074"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1101\/2019.12.13.875625"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1186\/s13015-021-00184-7"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45257-5_14"},{"key":"ref66","first-page":"682d","article-title":"Ensembl 2020","volume":"48","author":"yates","year":"2020","journal-title":"Nucleic Acids Res"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139940023"},{"key":"ref68","first-page":"1277","article-title":"Algorithm for solution of a problem of maximum flow in networks with power estimation","volume":"11","author":"dinic","year":"1970","journal-title":"Sov Math Doklady"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1145\/321694.321699"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1093\/protein\/3.7.565"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2016.0141"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1113972108"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-14-S5-S15"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40453-5_8"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1186\/s12859-019-2786-5"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33122-0_14"},{"key":"ref26","first-page":"16:1","article-title":"Flow decomposition with subpath constraints","author":"williams","year":"2021","journal-title":"Proc 21st Int Workshop Algorithms Bioinf"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0232946"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1038\/ng.259"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1098\/rstb.2019.0097"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/s12561-012-9069-2"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-12-162"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1101\/gr.142232.112"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.1633"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1186\/s13059-019-1910-1"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btab540"},{"key":"ref53","first-page":"404","article-title":"Evaluating approaches to find exon chains based on long reads","volume":"19","author":"kuosmanen","year":"2018","journal-title":"Brief Bioinf"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1186\/s13059-020-1935-5"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.1621"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-14-S5-S14"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-15-S9-S5"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btt127"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1186\/s13059-016-1074-1"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1101\/gr.257766.119"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2010.0243"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2011.0171"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2382936.2382983"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.3122"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btu317"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2017.2785831"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(94)90049-3"},{"key":"ref6","first-page":"43:1","article-title":"Genome assembly, from practice to theory: Safe, complete and linear-time","author":"cairo","year":"2021","journal-title":"Proc 48th Int Colloq Automata Lang Program"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3341731"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1101\/gr.1304504"},{"key":"ref7","article-title":"Genome assembly, a universal theoretical framework: Unifying and generalizing the safe and complete algorithms","author":"cairo","year":"2020"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1038\/nature10933"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.3389\/fmicb.2012.00329"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1101\/gr.081422.108"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1038\/nmeth.1226"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1038\/nrg2484"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.febslet.2005.02.047"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/99935.99944"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1979.234213"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1038\/nmeth.1223"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/692645"}],"container-title":["IEEE\/ACM Transactions on Computational Biology and Bioinformatics"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/8857\/9976468\/9628018-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8857\/9976468\/09628018.pdf?arnumber=9628018","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T18:44:04Z","timestamp":1722537844000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9628018\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,1]]},"references-count":75,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tcbb.2021.3131203","relation":{},"ISSN":["1545-5963","1557-9964","2374-0043"],"issn-type":[{"value":"1545-5963","type":"print"},{"value":"1557-9964","type":"electronic"},{"value":"2374-0043","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,1]]}}}