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

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

Full description

Bibliographic Details
Main Authors: Yaron Orenstein, David Pellow, Guillaume Marçais, Ron Shamir, Carl Kingsford
Format: Article
Language:English
Published: Public Library of Science (PLoS) 2017-10-01
Series:PLoS Computational Biology
Online Access:http://europepmc.org/articles/PMC5645146?pdf=render