Article
The mod-minimizer: a simple and efficient sampling algorithm for long <i>k</i> -mers
2024-05-31
Abstract excerpt
<h4>Motivation</h4> Given a string S , a minimizer scheme is an algorithm defined by a triple ( k, w , ๐ช) that samples a subset of k -mers ( k -long substrings) from a string S . Specifically, it samples the minimal k -mer according to the order ๐ช from each window of w consecutive k -mers in S . Because consecutive windows can sample the same k -mer, the set of the sampled k -mers is typically much...
Topics
Open a Topic to create a Post that cites this publication.
Identifiers and source
- Literature Corpus work
- 38cb36ba-f14f-5a2c-bf18-7cf98c9bc8ac
- DOI
- 10.1101/2024.05.25.595898
