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ženo v:

Podrobná bibliografie
Vydáno v:	IEEE/ACM transactions on computational biology and bioinformatics Ročník 19; číslo 6; s. 3673 - 3684
Hlavní autoři:	Caceres, Manuel, Mumey, Brendan, Husic, Edin, Rizzi, Romeo, Cairo, Massimo, Sahlin, Kristoffer, Tomescu, Alexandru I.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	United States IEEE 01.11.2022 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!