research
∙
07/05/2023
Linear-time computation of generalized minimal absent words for multiple strings
A string w is called a minimal absent word (MAW) for a string S if w doe...
share
research
∙
07/04/2023
Sliding suffix trees simplified
Sliding suffix trees (Fiala Greene, 1989) for an input text T over a...
research
∙
06/03/2019
Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets
We present the first worst-case linear time algorithm that directly comp...
research
∙
04/09/2019
