Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG

A multi-assembly problem asks to reconstruct multiple genomic sequences from mixed reads sequenced from all of them. Standard formulations of such problems model a solution as a path cover in a directed acyclic graph, namely a set of paths that together cover all vertices of the graph. Since multi-a...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE/ACM transactions on computational biology and bioinformatics Ročník 19; číslo 6; s. 3673 - 3684
Hlavní autori:	Caceres, Manuel, Mumey, Brendan, Husic, Edin, Rizzi, Romeo, Cairo, Massimo, Sahlin, Kristoffer, Tomescu, Alexandru I.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	United States IEEE 01.11.2022 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Algorithms Analysis of Algorithms and Problem Complexity Annotations Apexes Assembly Base Sequence Bioinformatics Biology and genetics Computer Science Constraints datalogi Genome Genomics Graph algorithms Graph theory Network problems RNA Safety Sequential analysis Splicing
ISSN:	1545-5963, 1557-9964, 1557-9964
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Abstract	A multi-assembly problem asks to reconstruct multiple genomic sequences from mixed reads sequenced from all of them. Standard formulations of such problems model a solution as a path cover in a directed acyclic graph, namely a set of paths that together cover all vertices of the graph. Since multi-assembly problems admit multiple solutions in practice, we consider an approach commonly used in standard genome assembly: output only partial solutions ( contigs , or safe paths ), that appear in all path cover solutions. We study constrained path covers, a restriction on the path cover solution that incorporate practical constraints arising in multi-assembly problems. We give efficient algorithms finding all maximal safe paths for constrained path covers. We compute the safe paths of splicing graphs constructed from transcript annotations of different species. Our algorithms run in less than 15 seconds per species and report RNA contigs that are over 99% precise and are up to 8 times longer than unitigs. Moreover, RNA contigs cover over 70% of the transcripts and their coding sequences in most cases. With their increased length to unitigs, high precision, and fast construction time, maximal safe paths can provide a better base set of sequences for transcript assembly programs.
AbstractList	A multi-assembly problem asks to reconstruct multiple genomic sequences from mixed reads sequenced from all of them. Standard formulations of such problems model a solution as a path cover in a directed acyclic graph, namely a set of paths that together cover all vertices of the graph. Since multi-assembly problems admit multiple solutions in practice, we consider an approach commonly used in standard genome assembly: output only partial solutions (contigs, or safe paths), that appear in all path cover solutions. We study constrained path covers, a restriction on the path cover solution that incorporate practical constraints arising in multi-assembly problems. We give efficient algorithms finding all maximal safe paths for constrained path covers. We compute the safe paths of splicing graphs constructed from transcript annotations of different species. Our algorithms run in less than 15 seconds per species and report RNA contigs that are over 99% precise and are up to 8 times longer than unitigs. Moreover, RNA contigs cover over 70% of the transcripts and their coding sequences in most cases. With their increased length to unitigs, high precision, and fast construction time, maximal safe paths can provide a better base set of sequences for transcript assembly programs.A multi-assembly problem asks to reconstruct multiple genomic sequences from mixed reads sequenced from all of them. Standard formulations of such problems model a solution as a path cover in a directed acyclic graph, namely a set of paths that together cover all vertices of the graph. Since multi-assembly problems admit multiple solutions in practice, we consider an approach commonly used in standard genome assembly: output only partial solutions (contigs, or safe paths), that appear in all path cover solutions. We study constrained path covers, a restriction on the path cover solution that incorporate practical constraints arising in multi-assembly problems. We give efficient algorithms finding all maximal safe paths for constrained path covers. We compute the safe paths of splicing graphs constructed from transcript annotations of different species. Our algorithms run in less than 15 seconds per species and report RNA contigs that are over 99% precise and are up to 8 times longer than unitigs. Moreover, RNA contigs cover over 70% of the transcripts and their coding sequences in most cases. With their increased length to unitigs, high precision, and fast construction time, maximal safe paths can provide a better base set of sequences for transcript assembly programs. A multi-assembly problem asks to reconstruct multiple genomic sequences from mixed reads sequenced from all of them. Standard formulations of such problems model a solution as a path cover in a directed acyclic graph, namely a set of paths that together cover all vertices of the graph. Since multi-assembly problems admit multiple solutions in practice, we consider an approach commonly used in standard genome assembly: output only partial solutions ( contigs , or safe paths ), that appear in all path cover solutions. We study constrained path covers, a restriction on the path cover solution that incorporate practical constraints arising in multi-assembly problems. We give efficient algorithms finding all maximal safe paths for constrained path covers. We compute the safe paths of splicing graphs constructed from transcript annotations of different species. Our algorithms run in less than 15 seconds per species and report RNA contigs that are over 99% precise and are up to 8 times longer than unitigs. Moreover, RNA contigs cover over 70% of the transcripts and their coding sequences in most cases. With their increased length to unitigs, high precision, and fast construction time, maximal safe paths can provide a better base set of sequences for transcript assembly programs.
Author	Mumey, Brendan Caceres, Manuel Rizzi, Romeo Husic, Edin Tomescu, Alexandru I. Sahlin, Kristoffer Cairo, Massimo
Author_xml	– sequence: 1 givenname: Manuel orcidid: 0000-0003-0235-6951 surname: Caceres fullname: Caceres, Manuel email: manuel.caceresreyes@helsinki.fi organization: Department of Computer Science, University of Helsinki, Helsinki, Finland – sequence: 2 givenname: Brendan orcidid: 0000-0001-7151-2124 surname: Mumey fullname: Mumey, Brendan email: brendan.mumey@montana.edu organization: School of Computer Science, Montana State University, Bozeman, MT, USA – sequence: 3 givenname: Edin orcidid: 0000-0002-6708-5112 surname: Husic fullname: Husic, Edin email: e.husic@lse.ac.uk organization: Department of Mathematics, London School of Economics and Political Science, London, U.K – sequence: 4 givenname: Romeo orcidid: 0000-0002-2387-0952 surname: Rizzi fullname: Rizzi, Romeo email: romeo.rizzi@univr.it organization: Department of Computer Science, University of Verona, Verona, Italy – sequence: 5 givenname: Massimo surname: Cairo fullname: Cairo, Massimo email: cairomassimo@gmail.com organization: Department of Computer Science, University of Helsinki, Helsinki, Finland – sequence: 6 givenname: Kristoffer orcidid: 0000-0001-7378-2320 surname: Sahlin fullname: Sahlin, Kristoffer email: ksahlin@math.su.se organization: Department of Mathematics, Science for Life Laboratory, Stockholm University, Stockholm, Sweden – sequence: 7 givenname: Alexandru I. orcidid: 0000-0002-5747-8350 surname: Tomescu fullname: Tomescu, Alexandru I. email: alexandru.tomescu@helsinki.fi organization: Department of Computer Science, University of Helsinki, Helsinki, Finland
BackLink	https://www.ncbi.nlm.nih.gov/pubmed/34847041$$D View this record in MEDLINE/PubMed https://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-199751$$DView record from Swedish Publication Index (Stockholms universitet)
BookMark	eNp9kctu1DAUhi1URC_wAAgJWWLTRTP4GtvLdHpDKgKJwtZyPCfFVSZO7aRo3r5JZ9pFF6zO0dH3n9t_iPa62AFCHylZUErM15vl6emCEUYXnHLKCH-DDqiUqjCmFHtzLmQhTcn30WHOd4QwYYh4h_a50EIRQQ_Q1S_XwLDBocPfx3YIRZUzrOt2gx-Cwz_d8Dfjqu_BpdDdzlTVtk9lvIwPkDKODXb4rLp8j942rs3wYReP0O-L85vlVXH94_LbsrouvGBmKIySpaFekRVvCHiyosZrIpTS2hMtoakN884ZqfS0qilpWZNacuDaNQoa4EfoZNs3_4N-rG2fwtqljY0u2LPwp7Ix3do8WmqmUXTCj7d4n-L9CHmw65A9tK3rII7ZspJIxjShfEK_vELv4pi66RjLlNCyFFSTifq8o8Z6DauX-c8vnQC1BXyKOSdorA-DG0LshuRCaymxs3l2Ns_O5tmdeZOSvlI-N_-f5tNWEwDghTflfJLmj8CpoE4
CODEN	ITCBCY
CitedBy_id	crossref_primary_10_1089_cmb_2022_0261 crossref_primary_10_1016_j_isci_2024_111208
Cites_doi	10.1038/nbt.4020 10.1101/gr.131383.111 10.1089/cmb.2019.0286 10.1089/cmb.2010.0243 10.1371/journal.pcbi.1000074 10.1007/s12561-012-9069-2 10.1186/s13059-014-0501-4 10.1073/pnas.1113972108 10.1101/gr.081422.108 10.2307/1969503 10.1007/978-3-642-40453-5_8 10.1186/s13015-021-00184-7 10.1093/bioinformatics/btab540 10.1186/s13059-020-1935-5 10.1186/1471-2105-12-119 10.1101/gr.257766.119 10.1038/nbt.3122 10.1155/2013/692645 10.1093/bioinformatics/btv033 10.1089/cmb.2011.0171 10.3389/fmicb.2012.00329 10.1093/bioinformatics/btz443 10.1145/3341731 10.1038/nmeth.1226 10.1016/0167-6377(94)90049-3 10.1007/978-3-030-45257-5_14 10.1186/1471-2105-14-S5-S14 10.1186/1471-2105-12-162 10.1186/1471-2105-15-S9-S5 10.1186/s12859-019-2786-5 10.1089/cmb.2016.0141 10.1186/s13059-019-1910-1 10.1145/99935.99944 10.1017/CBO9781139940023 10.1038/nmeth.2714 10.1093/protein/3.7.565 10.1186/1471-2105-14-S5-S15 10.1038/s41592-019-0669-3 10.1101/2019.12.13.875625 10.1098/rstb.2019.0097 10.1038/nmeth.1223 10.1038/nature10933 10.1145/2382936.2382983 10.1007/978-3-642-33122-0_14 10.1038/ng.259 10.1145/3301312 10.1186/s13059-020-02151-8 10.1371/journal.pone.0232946 10.1093/bioinformatics/btt127 10.1109/TCBB.2017.2785831 10.1038/nrg2484 10.1101/gr.142232.112 10.1109/IPDPS.2019.00055 10.1109/TSE.1979.234213 10.1016/j.febslet.2005.02.047 10.1093/bioinformatics/btu317 10.1101/gr.1304504 10.1007/BF01188580 10.1016/j.entcs.2011.06.003 10.1038/nbt.1621 10.1186/s13059-016-1074-1 10.1145/321694.321699 10.1038/nbt.1633
ContentType	Journal Article
Copyright	Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2022
Copyright_xml	– notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2022
DBID	97E ESBDL RIA RIE AAYXX CITATION CGR CUY CVF ECM EIF NPM 7QF 7QO 7QQ 7SC 7SE 7SP 7SR 7TA 7TB 7U5 8BQ 8FD F28 FR3 H8D JG9 JQ2 KR7 L7M L~C L~D P64 7X8 ABAVF ADTPV AOWAS D8T DG7 ZZAVC
DOI	10.1109/TCBB.2021.3131203
DatabaseName	IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE Xplore Open Access Journals IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Medline MEDLINE MEDLINE (Ovid) MEDLINE MEDLINE PubMed Aluminium Industry Abstracts Biotechnology Research Abstracts Ceramic Abstracts Computer and Information Systems Abstracts Corrosion Abstracts Electronics & Communications Abstracts Engineered Materials Abstracts Materials Business File Mechanical & Transportation Engineering Abstracts Solid State and Superconductivity Abstracts METADEX Technology Research Database ANTE: Abstracts in New Technology & Engineering Engineering Research Database Aerospace Database Materials Research Database ProQuest Computer Science Collection Civil Engineering Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Biotechnology and BioEngineering Abstracts MEDLINE - Academic SWEPUB Stockholms universitet full text SwePub SwePub Articles SWEPUB Freely available online SWEPUB Stockholms universitet SwePub Articles full text
DatabaseTitle	CrossRef MEDLINE Medline Complete MEDLINE with Full Text PubMed MEDLINE (Ovid) Materials Research Database Civil Engineering Abstracts Aluminium Industry Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Mechanical & Transportation Engineering Abstracts Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Ceramic Abstracts Materials Business File METADEX Biotechnology and BioEngineering Abstracts Computer and Information Systems Abstracts Professional Aerospace Database Engineered Materials Abstracts Biotechnology Research Abstracts Solid State and Superconductivity Abstracts Engineering Research Database Corrosion Abstracts Advanced Technologies Database with Aerospace ANTE: Abstracts in New Technology & Engineering MEDLINE - Academic
DatabaseTitleList	MEDLINE - Academic MEDLINE Materials Research Database
Database_xml	– sequence: 1 dbid: NPM name: PubMed url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 2 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher – sequence: 3 dbid: 7X8 name: MEDLINE - Academic url: https://search.proquest.com/medline sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Biology Computer Science
EISSN	1557-9964
EndPage	3684
ExternalDocumentID	oai_DiVA_org_su_199751 34847041 10_1109_TCBB_2021_3131203 9628018
Genre	orig-research Research Support, Non-U.S. Gov't Journal Article
GrantInformation_xml	– fundername: Academy of Finland grantid: 322595; 328877 funderid: 10.13039/501100002341 – fundername: U.S. Fulbright Program – fundername: National Science Foundation grantid: DBI-1759522 funderid: 10.13039/501100008982 – fundername: European Research Council grantid: 851093 (SAFEBIO) funderid: 10.13039/501100000781 – fundername: Fulbright Finland Foundation – fundername: Helsinki Institute for Information Technology
GroupedDBID	0R~ 29I 4.4 53G 5GY 5VS 6IK 8US 97E AAJGR AAKMM AALFJ AARMG AASAJ AAWTH AAWTV ABAZT ABQJQ ABVLG ACGFO ACGFS ACIWK ACM ACPRK ADBCU ADL AEBYY AEFXT AEJOY AENEX AENSD AETIX AFRAH AFWIH AFWXC AGQYO AGSQL AHBIQ AIBXA AIKLT AKJIK AKQYR AKRVB ALMA_UNASSIGNED_HOLDINGS ASPBG ATWAV AVWKF BDXCO BEFXN BFFAM BGNUA BKEBE BPEOZ CCLIF CS3 DU5 EBS EJD ESBDL FEDTE GUFHI HGAVV HZ~ I07 IEDLZ IFIPE IPLJI JAVBF LAI LHSKQ M43 O9- OCL P1C P2P PQQKQ RIA RIE RNI RNS ROL RZB TN5 XOL AAYXX CITATION AAYOK ADPZR CGR CUY CVF ECM EIF NPM RIG W7O 7QF 7QO 7QQ 7SC 7SE 7SP 7SR 7TA 7TB 7U5 8BQ 8FD F28 FR3 H8D JG9 JQ2 KR7 L7M L~C L~D P64 7X8 ABAVF ADTPV AOWAS D8T DG7 ZZAVC
ID	FETCH-LOGICAL-c429t-975691c70d3f0ec0d19c8047788c085efb92caa95789049616b0b53e38af7efe3
IEDL.DBID	RIE
ISICitedReferencesCount	5
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000966719600060&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1545-5963 1557-9964
IngestDate	Tue Nov 04 17:19:27 EST 2025 Thu Oct 02 09:47:02 EDT 2025 Mon Jun 30 03:43:40 EDT 2025 Thu Apr 03 07:05:58 EDT 2025 Sat Nov 29 01:52:05 EST 2025 Tue Nov 18 21:36:21 EST 2025 Wed Aug 27 02:34:38 EDT 2025
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	6
Language	English
License	https://creativecommons.org/licenses/by/4.0/legalcode
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c429t-975691c70d3f0ec0d19c8047788c085efb92caa95789049616b0b53e38af7efe3
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23
ORCID	0000-0001-7151-2124 0000-0001-7378-2320 0000-0002-6708-5112 0000-0003-0235-6951 0000-0002-2387-0952 0000-0002-5747-8350
OpenAccessLink	https://ieeexplore.ieee.org/document/9628018
PMID	34847041
PQID	2748564180
PQPubID	85499
PageCount	12
ParticipantIDs	proquest_miscellaneous_2605228013 crossref_primary_10_1109_TCBB_2021_3131203 pubmed_primary_34847041 crossref_citationtrail_10_1109_TCBB_2021_3131203 proquest_journals_2748564180 ieee_primary_9628018 swepub_primary_oai_DiVA_org_su_199751
PublicationCentury	2000
PublicationDate	2022-11-01
PublicationDateYYYYMMDD	2022-11-01
PublicationDate_xml	– month: 11 year: 2022 text: 2022-11-01 day: 01
PublicationDecade	2020
PublicationPlace	United States
PublicationPlace_xml	– name: United States – name: New York
PublicationTitle	IEEE/ACM transactions on computational biology and bioinformatics
PublicationTitleAbbrev	TCBB
PublicationTitleAlternate	IEEE/ACM Trans Comput Biol Bioinform
PublicationYear	2022
Publisher	IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml	– name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References	ref57 ref13 ref56 ref12 ref59 ref15 ref58 ref14 ref52 ref55 ref11 ref54 ref10 ref17 ref16 dinic (ref68) 1970; 11 ref19 ref18 ref51 ref50 cáceres (ref75) 2021 ref46 ref45 ref48 ref47 ref42 ref41 ref44 ref43 fulkerson (ref32) 1956; 7 williams (ref26) 2021 ref49 ref8 dantzig (ref72) 1998; 48 ref9 ref4 ref3 ref5 ref40 kuosmanen (ref53) 2018; 19 ref34 ref37 ref36 ref31 ref74 ref30 ref2 ref1 cairo (ref7) 2020 ref39 ref38 damian (ref71) 1991 ref70 ref73 cáceres (ref35) 2021 ref24 ref67 ref23 cairo (ref6) 2021 ref69 ref25 ref64 ref20 ref63 ref22 ref65 ref21 ref28 ref27 ref29 ref60 ref62 ref61 bang-jensen (ref33) 2008 yates (ref66) 2020; 48
References_xml	– ident: ref61 doi: 10.1038/nbt.4020 – ident: ref73 doi: 10.1101/gr.131383.111 – ident: ref63 doi: 10.1089/cmb.2019.0286 – ident: ref15 doi: 10.1089/cmb.2010.0243 – ident: ref27 doi: 10.1371/journal.pcbi.1000074 – ident: ref59 doi: 10.1007/s12561-012-9069-2 – ident: ref60 doi: 10.1186/s13059-014-0501-4 – ident: ref20 doi: 10.1073/pnas.1113972108 – ident: ref46 doi: 10.1101/gr.081422.108 – ident: ref31 doi: 10.2307/1969503 – ident: ref21 doi: 10.1007/978-3-642-40453-5_8 – ident: ref65 doi: 10.1186/s13015-021-00184-7 – ident: ref54 doi: 10.1093/bioinformatics/btab540 – ident: ref52 doi: 10.1186/s13059-020-1935-5 – year: 2021 ident: ref35 article-title: Sparsifying, shrinking and splicing for minimum path cover in parameterized linear time – ident: ref28 doi: 10.1186/1471-2105-12-119 – volume: 48 start-page: 682d year: 2020 ident: ref66 article-title: Ensembl 2020 publication-title: Nucleic Acids Res – ident: ref14 doi: 10.1101/gr.257766.119 – ident: ref18 doi: 10.1038/nbt.3122 – ident: ref43 doi: 10.1155/2013/692645 – ident: ref38 doi: 10.1093/bioinformatics/btv033 – ident: ref16 doi: 10.1089/cmb.2011.0171 – ident: ref9 doi: 10.3389/fmicb.2012.00329 – ident: ref30 doi: 10.1093/bioinformatics/btz443 – ident: ref5 doi: 10.1145/3341731 – ident: ref45 doi: 10.1038/nmeth.1226 – ident: ref3 doi: 10.1016/0167-6377(94)90049-3 – start-page: 43:1 year: 2021 ident: ref6 article-title: Genome assembly, from practice to theory: Safe, complete and linear-time publication-title: Proc 48th Int Colloq Automata Lang Program – ident: ref29 doi: 10.1007/978-3-030-45257-5_14 – volume: 19 start-page: 404 year: 2018 ident: ref53 article-title: Evaluating approaches to find exon chains based on long reads publication-title: Brief Bioinf – ident: ref11 doi: 10.1186/1471-2105-14-S5-S14 – ident: ref58 doi: 10.1186/1471-2105-12-162 – ident: ref40 doi: 10.1186/1471-2105-15-S9-S5 – ident: ref24 doi: 10.1186/s12859-019-2786-5 – volume: 7 start-page: 701 year: 1956 ident: ref32 article-title: Note on Dilworthâs decomposition theorem for partially ordered sets publication-title: Proc Amer Math Soc – ident: ref1 doi: 10.1089/cmb.2016.0141 – ident: ref55 doi: 10.1186/s13059-019-1910-1 – ident: ref42 doi: 10.1145/99935.99944 – ident: ref67 doi: 10.1017/CBO9781139940023 – ident: ref62 doi: 10.1038/nmeth.2714 – ident: ref2 doi: 10.1093/protein/3.7.565 – ident: ref22 doi: 10.1186/1471-2105-14-S5-S15 – ident: ref39 doi: 10.1038/s41592-019-0669-3 – ident: ref64 doi: 10.1101/2019.12.13.875625 – ident: ref51 doi: 10.1098/rstb.2019.0097 – ident: ref44 doi: 10.1038/nmeth.1223 – ident: ref49 doi: 10.1038/nature10933 – ident: ref17 doi: 10.1145/2382936.2382983 – start-page: 257 year: 2021 ident: ref75 article-title: A linear-time parameterized algorithm for computing the width of a DAG publication-title: Proc Int Workshop Graph-Theor Concepts Comput Sci – ident: ref23 doi: 10.1007/978-3-642-33122-0_14 – volume: 11 start-page: 1277 year: 1970 ident: ref68 article-title: Algorithm for solution of a problem of maximum flow in networks with power estimation publication-title: Sov Math Doklady – ident: ref50 doi: 10.1038/ng.259 – year: 2008 ident: ref33 publication-title: Digraphs Theory Algorithms and Applications – ident: ref34 doi: 10.1145/3301312 – volume: 48 year: 1998 ident: ref72 publication-title: Linear Programming and Extensions – year: 2020 ident: ref7 article-title: Genome assembly, a universal theoretical framework: Unifying and generalizing the safe and complete algorithms – ident: ref36 doi: 10.1186/s13059-020-02151-8 – ident: ref25 doi: 10.1371/journal.pone.0232946 – ident: ref12 doi: 10.1093/bioinformatics/btt127 – ident: ref4 doi: 10.1109/TCBB.2017.2785831 – ident: ref48 doi: 10.1038/nrg2484 – ident: ref57 doi: 10.1101/gr.142232.112 – ident: ref74 doi: 10.1109/IPDPS.2019.00055 – ident: ref41 doi: 10.1109/TSE.1979.234213 – year: 1991 ident: ref71 article-title: The minimum cost flow problem and the network simplex method – ident: ref47 doi: 10.1016/j.febslet.2005.02.047 – ident: ref19 doi: 10.1093/bioinformatics/btu317 – start-page: 16:1 year: 2021 ident: ref26 article-title: Flow decomposition with subpath constraints publication-title: Proc 21st Int Workshop Algorithms Bioinf – ident: ref8 doi: 10.1101/gr.1304504 – ident: ref37 doi: 10.1007/BF01188580 – ident: ref70 doi: 10.1016/j.entcs.2011.06.003 – ident: ref10 doi: 10.1038/nbt.1621 – ident: ref13 doi: 10.1186/s13059-016-1074-1 – ident: ref69 doi: 10.1145/321694.321699 – ident: ref56 doi: 10.1038/nbt.1633
SSID	ssj0024904
Score	2.3650787
Snippet	A multi-assembly problem asks to reconstruct multiple genomic sequences from mixed reads sequenced from all of them. Standard formulations of such problems...
SourceID	swepub proquest pubmed crossref ieee
SourceType	Open Access Repository Aggregation Database Index Database Enrichment Source Publisher
StartPage	3673
SubjectTerms	Algorithms Analysis of Algorithms and Problem Complexity Annotations Apexes Assembly Base Sequence Bioinformatics Biology and genetics Computer Science Constraints datalogi Genome Genomics Graph algorithms Graph theory Network problems RNA Safety Sequential analysis Splicing
Title	Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG
URI	https://ieeexplore.ieee.org/document/9628018 https://www.ncbi.nlm.nih.gov/pubmed/34847041 https://www.proquest.com/docview/2748564180 https://www.proquest.com/docview/2605228013 https://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-199751
Volume	19
WOSCitedRecordID	wos000966719600060&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1557-9964 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0024904 issn: 1545-5963 databaseCode: RIE dateStart: 20040101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3daxQxEB_aouBL_ai2q7VE0BdxbbJfSR6vV2sfpBSscm8hm53Awbkn3bvC_fdOsnsrShF8WzazIcxMMjM7md8AvOUV8krnOhVWOgpQnE-19jotSsk18rxuMOLMfpFXV2o209c78GGshUHEePkMP4bHmMtvlm4dfpWd6iqjA1Xtwq6Usq_V-o2rp2OrwOARpCVp1ZDBFFyf3kzPzigSzAQFqLnIeOidkxd0LPNC_GGOYn-V-1zNv3BEo-25ePx_q34C-4OPySa9UjyFHWyfwcO-6-TmAC6_Wo-rDZu3LJbfpiHx-6NebNjd3LJrcgk7Rs4pbQEya4FqsljE12wa7nt2bOmZZeeTz8_h28Wnm-llOjRUSB2ZnVWqZVlp4SRvcs_R8UZop3ghKQx25Hqhr3XmrNVlqI4tdCWqmtdljrmyXqLH_AXstcsWj4C5CpFjHbBwyOOyVd0Uha2VEmVjfda4BPiWr8YNaOOh6cXCxKiDaxOkYoJUzCCVBN6Pn_zsoTb-RXwQOD0SDkxO4HgrPDNsxs5Q4K3KqhCKJ_BmHKZtFHIjtsXlmmgorAvIQIJmPuyFPs691ZUE3vVaMI4EbO7z-feJIYGbbm3CrZ1SvLx_ba_gURZqJ2Ih4zHsrW7X-BoeuLvVvLs9IZ2eqZOo078AbCfsjQ
linkProvider	IEEE
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3db9MwED-NAYIXvsZHYICR4AURZid2Ej92HaOIUk2ioL1ZjnORKpUULe2k_vecnTQINCHxFsUXy7o7--5yvt8BvOYZ8kynOhY2dxSguDrWutaxVDnXyNOywoAzO81ns-L8XJ_twbuhFgYRw-UzfO8fQy6_WrmN_1V2pLOEDtTiGlxXUiaiq9b6jaynQ7NA7xPEivSqz2EKro_m4-NjigUTQSFqKhLuu-ekkg5mLsUfBil0WLnK2fwLSTRYn9O7_7fue3Cn9zLZqFOL-7CHzQO42fWd3B7A5Kutcb1li4aFAtzYp35_lMstu1xYdkZOYcvIPaVNQIbNU42Wy_Cajf2Nz5atambZyejjQ_h2-mE-nsR9S4XYkeFZxzpXmRYu51Vac3S8EtoVXOYUCDtyvrAudeKs1crXx0qdiazkpUoxLWydY43pI9hvVg0-AeYyRI6lR8Mhn8tmZSWlLYtCqMrWSeUi4Du-Gtfjjfu2F0sT4g6ujZeK8VIxvVQieDt88rMD2_gX8YHn9EDYMzmCw53wTL8dW0Ohd6EyKQoewathmDaSz47YBlcboqHAzmMDCZr5cSf0Ye6drkTwptOCYcSjc58svo8MCdy0G-Pv7Sjx9Oq1vYRbk_mXqZl-mn1-BrcTX0kRyhoPYX99scHncMNdrhftxYug2b8AT2Xu7A
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Safety+in+Multi-Assembly+via+Paths+Appearing+in+All+Path+Covers+of+a+DAG&rft.jtitle=IEEE%2FACM+transactions+on+computational+biology+and+bioinformatics&rft.au=Caceres%2C+Manuel&rft.au=Mumey%2C+Brendan&rft.au=Husic%2C+Edin&rft.au=Rizzi%2C+Romeo&rft.date=2022-11-01&rft.eissn=1557-9964&rft.volume=19&rft.issue=6&rft.spage=3673&rft_id=info:doi/10.1109%2FTCBB.2021.3131203&rft_id=info%3Apmid%2F34847041&rft.externalDocID=34847041
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1545-5963&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1545-5963&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1545-5963&client=summon