Inferring strings from Lyndon factorization
From MaRDI portal
Publication:2402270
DOI10.1016/j.tcs.2017.05.038zbMath1372.68218MaRDI QIDQ2402270
Hideo Bannai, Shunsuke Inenaga, Yuto Nakashima, Takashi Okabe, Masayuki Takeda, Tomohiro I.
Publication date: 7 September 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.05.038
Related Items
Reconstructing parameterized strings from parameterized suffix and LCP arrays, Universal reconstruction of a string
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Inferring strings from suffix trees and links on a binary alphabet
- Faster Lyndon factorization algorithms for SLP and LZ78 compressed text
- Lyndon + Christoffel = digitally convex
- Counting suffix arrays and strings
- Génération d'une section des classes de conjugaison et arbre des mots de Lyndon de longueur bornée. (Generation of a section of conjugation classes and trees of Lyndon words of bounded length)
- Counting distinct strings
- Parallel RAM algorithms for factorizing words
- Validating the Knuth-Morris-Pratt failure function, fast and online
- Periodic musical sequences and Lyndon words
- Inferring Strings from Lyndon Factorization
- Factorizing words over an ordered alphabet
- Efficient validation and construction of border arrays and validation of string matching automata
- Two-way string-matching
- Fast parallel Lyndon factorization with applications
- Words over an ordered alphabet and suffix permutations
- Reversing Longest Previous Factor Tables is Hard
- Mathematical Foundations of Computer Science 2003
- On Burnside's Problem
- Free differential calculus. IV: The quotient groups of the lower central series
