Finding the leftmost critical factorization on unordered alphabet
From MaRDI portal
Publication:290524
DOI10.1016/j.tcs.2016.04.037zbMath1342.68368arXiv1509.01018OpenAlexW2964272781MaRDI QIDQ290524
Publication date: 1 June 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.01018
critical pointscritical factorizationCrochemore-Perrin algorithmleftmost critical pointunordered alphabet
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear computation of unbordered conjugate on unordered alphabet
- Linear-time computation of local periods
- Computing runs on a general alphabet
- Time-space-optimal string matching
- Online Detection of Repetitions with Backtracking
- Lempel-Ziv Factorization May Be Harder Than Computing All Runs
- Simple Real-Time Constant-Space String Matching
- Factorizing words over an ordered alphabet
- On the Tree of Ternary Square-Free Words
- Algorithms on Strings, Trees and Sequences
This page was built for publication: Finding the leftmost critical factorization on unordered alphabet