Designing small universal k-mer hitting sets for improved analysis of high-throughput sequencing

Yaron Orenstein, David Pellow, Guillaume Marçais, Ron Shamir, Carl Kingsford

Research output: Contribution to journalArticlepeer-review

19 Scopus citations

Abstract

With the rapidly increasing volume of deep sequencing data, more efficient algorithms and data structures are needed. Minimizers are a central recent paradigm that has improved various sequence analysis tasks, including hashing for faster read overlap detection, sparse suffix arrays for creating smaller indexes, and Bloom filters for speeding up sequence search. Here, we propose an alternative paradigm that can lead to substantial further improvement in these and other tasks. For integers k and L > k, we say that a set of k-mers is a universal hitting set (UHS) if every possible L-long sequence must contain a k-mer from the set. We develop a heuristic called DOCKS to find a compact UHS, which works in two phases: The first phase is solved optimally, and for the second we propose several efficient heuristics, trading set size for speed and memory. The use of heuristics is motivated by showing the NP-hardness of a closely related problem. We show that DOCKS works well in practice and produces UHSs that are very close to a theoretical lower bound. We present results for various values of k and L and by applying them to real genomes show that UHSs indeed improve over minimizers. In particular, DOCKS uses less than 30% of the 10-mers needed to span the human genome compared to minimizers. The software and computed UHSs are freely available at github.com/Shamir-Lab/DOCKS/ and acgt.cs.tau.ac.il/docks/, respectively.

Original languageEnglish
Article numbere1005777
JournalPLoS Computational Biology
Volume13
Issue number10
DOIs
StatePublished - 1 Oct 2017
Externally publishedYes

Fingerprint

Dive into the research topics of 'Designing small universal k-mer hitting sets for improved analysis of high-throughput sequencing'. Together they form a unique fingerprint.

Cite this