Safe and Complete Contig Assembly Via Omnitigs
@inproceedings{Tomescu2016SafeAC, title={Safe and Complete Contig Assembly Via Omnitigs}, author={Alexandru I. Tomescu and Paul Medvedev}, booktitle={RECOMB}, year={2016} }
Contig assembly is the first stage that most assemblers solve when reconstructing a genome from a set of reads. Its output consists of contigs -- a set of strings that are promised to appear in any genome that could have generated the reads. From the introduction of contigs 20 years ago, assemblers have tried to obtain longer and longer contigs, but the following question was never solved: given a genome graph $G$ (e.g. a de Bruijn, or a string graph), what are all the strings that can be… Expand
10 Citations
Genome assembly, from practice to theory: safe, complete and linear-time.
- Mathematics, Computer Science
- 2020
- 1
- PDF
A safe and complete algorithm for metagenomic assembly
- Computer Science, Medicine
- Algorithms for Molecular Biology
- 2018
- 5
From omnitigs to macrotigs: a linear-time algorithm for safe walks - common to all closed arc-coverings of a directed graph
- Mathematics, Computer Science
- ArXiv
- 2020
- 3
Overlap graphs and de Bruijn graphs: data structures for de novo genome assembly in the big data era
- Computer Science
- Quantitative Biology
- 2019
- 3
- PDF
An Optimal O(nm) Algorithm for Enumerating All Walks Common to All Closed Edge-covering Walks of a Graph
- Computer Science
- ACM Trans. Algorithms
- 2019
- 4
- PDF
deGSM: memory scalable construction of large scale de Bruijn Graph
- Computer Science, Biology
- 2018
- 12
- PDF
Safely Filling Gaps with Partial Solutions Common to All Solutions
- Computer Science, Medicine
- IEEE/ACM Transactions on Computational Biology and Bioinformatics
- 2019
- 5
- PDF
deBWT: parallel construction of Burrows–Wheeler Transform for large collection of genomes with de Bruijn-branch encoding
- Computer Science, Medicine
- Bioinform.
- 2016
- 11
- Highly Influenced
- PDF
References
SHOWING 1-10 OF 43 REFERENCES
BESST - Efficient scaffolding of large fragmented assemblies
- Biology, Computer Science
- BMC Bioinformatics
- 2014
- 107
- PDF
Efficient de novo assembly of large genomes using compressed data structures.
- Biology, Medicine
- Genome research
- 2012
- 709
- PDF
Efficient construction of an assembly string graph using the FM-index
- Mathematics, Computer Science
- Bioinform.
- 2010
- 240
- PDF
GAGE: A critical evaluation of genome assemblies and assembly algorithms.
- Biology, Medicine
- Genome research
- 2012
- 681
- PDF
Paired de Bruijn Graphs: A Novel Approach for Incorporating Mate Pair Information into Genome Assemblers
- Computer Science
- RECOMB
- 2011
- 42
- PDF
Velvet: algorithms for de novo short read assembly using de Bruijn graphs.
- Biology, Medicine
- Genome research
- 2008
- 8,598
- PDF
Assembly complexity of prokaryotic genomes using short reads
- Biology, Computer Science
- BMC Bioinformatics
- 2009
- 213
- Highly Influential
- PDF