• DOI:10.1007/978-3-319-31957-5_11
Corpus ID: 10260568

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

• Alexandru I. Tomescu, Paul Medvedev
• Published in RECOMB 2016
• Mathematics, Computer Science, Biology

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

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed