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!

Buďte prvý, kto okomentuje tento záznam!