In recent years, there has been a renewed interest in the search for low density minimizer schemes. These schemes take a window of $w$ consecutive $k$-mers, and sample one of them: the smallest under ...
My WABI submission: anti-lexicographic SUS-anchors.
For sigma=4, this selection scheme (a k=1 sampling scheme) has density within 1% of the lower bound!
The idea: find the smallest* substring that does not have a 2nd occurrence, and sample its start pos.
curiouscoding.nl/posts/sus-an...
