research
∙
11/24/2022
A fast and simple O (z log n)-space index for finding approximately longest common substrings
We describe how, given a text T [1..n] and a positive constant ϵ, we can...
share
research
∙
10/04/2022
Rectangular Ruler Wrapping
In 1985 Hopcroft, Joseph and Whitesides introduced the problem of foldin...
research
∙
02/10/2022
MONI can find k-MEMs
Maximal exact matches (MEMs) have been widely used in bioinformatics at ...
research
∙
01/29/2021
r-indexing Wheeler graphs
Let G be a Wheeler graph and r be the number of runs in a Burrows-Wheele...
research
∙
06/21/2020
PFP Data Structures
Prefix-free parsing (PFP) was introduced by Boucher et al. (2019) as a p...
research
∙
02/16/2018
