Theory of local k-mer selection with applications to long-read alignment.

Abstract excerpt

MOTIVATION: Selecting a subset of k-mers in a string in a local manner is a common task in bioinformatics tools for speeding up computation. Arguably the most well-known and common method is the minimizer technique, which selects the 'lowest-ordered' k-mer in a sliding window. Recently, it has been shown that minimizers may be a sub-optimal method for selecting subsets of k-mers when mutations are present. There...

Topics

Share this publication in a Topic to start or enrich a Post.

• Share to Algorithms
• Share to Mutation
• Share to Sequence Analysis, DNA