3 citations · 3 across the 4 of their papers we have counts for
4 papers · 1 filter
Algorithms for Galois Words: Detection, Factorization, and Rotation
Diptarama Hendrian, Dominik Köppl, Ryo Yoshinaka +1
Lyndon words are extensively studied in combinatorics on words -- they play a crucial role on upper bounding the number of runs a word can have [Bannai+, SIAM J. Comput.'17]. We ca…
Faster Prefix-Sorting Algorithms for Deterministic Finite Automata
Sung-Hwan Kim, Francisco Olivares, Nicola Prezza
Sorting is a fundamental algorithmic pre-processing technique which often allows to represent data more compactly and, at the same time, speeds up search queries on it. In this pap…
Computing matching statistics on Wheeler DFAs
Alessio Conte, Nicola Cotumaccio, Travis Gagie +3
Matching statistics were introduced to solve the approximate string matching problem, which is a recurrent subroutine in bioinformatics applications. In 2010, Ohlebusch et al. [SPI…
Fast Longest Common Extensions in Small Space
Alberto Policriti, Nicola Prezza
In this paper we address the longest common extension (LCE) problem: to compute the length of the longest common prefix between any two suffixes of with $ Σ= \{0,…