Article
BURST enables mathematically optimal short-read alignment for big data
2020-09-08
Abstract excerpt
One of the fundamental tasks in analyzing next-generation sequencing data is genome database search, in which DNA sequences are compared to known reference genomes for identification or annotation. Although algorithms exist for optimal database search with perfect sensitivity and specificity, these have largely been abandoned for next-generation sequencing (NGS) data in favor of faster heuristic algorithms that sa...
Topics
Open a Topic to create a Post that cites this publication.
Identifiers and source
- Literature Corpus work
- c8852465-5c63-543b-9422-6b980b26f786
- DOI
- 10.1101/2020.09.08.287128
