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...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE/ACM transactions on computational biology and bioinformatics Vol. 19; no. 6; pp. 3673 - 3684
Main Authors:	Caceres, Manuel, Mumey, Brendan, Husic, Edin, Rizzi, Romeo, Cairo, Massimo, Sahlin, Kristoffer, Tomescu, Alexandru I.
Format:	Journal Article
Language:	English
Published:	United States IEEE 01.11.2022 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!