Minimal Suffix and Rotation of a Substring in Optimal Time
From MaRDI portal
Publication:5369563
DOI10.4230/LIPIcs.CPM.2016.28zbMath1380.68151arXiv1601.08051OpenAlexW2963919504MaRDI QIDQ5369563
Publication date: 17 October 2017
Full work available at URL: https://arxiv.org/abs/1601.08051
Related Items (7)
Internal shortest absent word queries in constant time and linear space ⋮ Finding top-\(k\) longest palindromes in substrings ⋮ Near-optimal quantum algorithms for string problems ⋮ Dynamic and internal longest common substring ⋮ Efficient representation and counting of antipower factors in words ⋮ Efficient enumeration of non-equivalent squares in partial words with few holes ⋮ Lyndon factorization of grammar compressed texts revisited
This page was built for publication: Minimal Suffix and Rotation of a Substring in Optimal Time
