Inferring Strings from Lyndon Factorization
From MaRDI portal
Recommendations
- Inferring strings from Lyndon factorization
- Lyndon-like and V-order factorizations of strings
- Analyzing strings with ordered Lyndon-like structures
- Reconstructing a string from its Lyndon arrays
- Indeterminate string factorizations and degenerate text transformations
- String factorisations with maximum or minimum dimension
- Mathematical Foundations of Computer Science 2003
- Lyndon factorization algorithms for small alphabets and run-length encoded strings
- Suffix array and Lyndon factorization of a text
- String extension learning using lattices
Cited in
(14)- Optimal canonization of all substrings of a string
- Reconstructing a string from its Lyndon arrays
- Inverse Lyndon words and inverse Lyndon factorizations of words
- On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties
- Lyndon factorization algorithms for small alphabets and run-length encoded strings
- String inference from longest-common-prefix array
- Indeterminate string factorizations and degenerate text transformations
- Inferring strings from Lyndon factorization
- Linear construction of a left Lyndon tree
- Inferring strings from cover arrays
- Algorithms for the Lyndon unique maximal factorization
- scientific article; zbMATH DE number 4193132 (Why is no real title available?)
- Universal reconstruction of a string
- Efficient Lyndon factorization of grammar compressed text
This page was built for publication: Inferring Strings from Lyndon Factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2922642)
