65 citations · 333 across the 44 of their papers we have counts for
5 papers · 1 filter
Maximal Closed Substrings
Golnaz Badkobeh, Alessandro De Luca, Gabriele Fici +1
A string is closed if it has length 1 or has a nonempty border without internal occurrences. In this paper we introduce the definition of a \emph{maximal closed substring} (MCS), w…
Computing all-vs-all MEMs in run-length encoded collections of HiFi reads
Diego Díaz-Domínguez, Simon J. Puglisi, Leena Salmela
We describe an algorithm to find maximal exact matches (MEMs) among HiFi reads with homopolymer errors. The main novelty in our work is that we resort to run-length compression to…
Hierarchical Relative Lempel-Ziv Compression
Philip Bille, Inge Li Gørtz, Simon J. Puglisi +1
Relative Lempel-Ziv (RLZ) parsing is a dictionary compression method in which a string is compressed relative to a second string (called the reference) by parsing into…
Suffix sorting via matching statistics
Zsuzsanna Lipták, Francesco Masillo, Simon J. Puglisi
We introduce a new algorithm for constructing the generalized suffix array of a collection of highly similar strings. As a first step, we construct a compressed representation of t…
Computing Longest (Common) Lyndon Subsequences
Hideo Bannai, Tomohiro I, Tomasz Kociumaka +2
Given a string with length whose characters are drawn from an ordered alphabet of size , its longest Lyndon subsequence is a longest subsequence of that is a Lyndon…