Back to search

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
Open publication

Related research

Semantic proximity does not establish scientific evidence.

Click a neighbor to travelStep 1 ยท 12 closest
Interactive article relationship graphSelect a related publication card to move it into the centre and load its closest explainable connections. Solid lines are source-backed structured connections. Dashed lines are semantic discovery signals and are not scientific evidence.
The mod-minimizer: a simple and efficient sampling algorithm for long <i>k</i> -mersDOI 10.1101/2024.05.25.595898
Select a neighboring publication to make it the new centre.