PROPERTIES AND CONSTRUCTION OF UNIQUE MAXIMAL FACTORIZATION FAMILIES FOR STRINGS
From MaRDI portal
Recommendations
Cites work
- A public key cryptosystem based on Lyndon words
- Algorithms on Strings, Trees and Sequences
- Factorizing words over an ordered alphabet
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- Lyndon-like and V-order factorizations of strings
- Parallel RAM algorithms for factorizing words
- Toward a formal study of jazz chord sequences generated by Steedman's grammar
Cited in
(11)- Reconstructing a string from its Lyndon arrays
- Enhanced string factoring from alphabet orderings
- Lyndon-like and V-order factorizations of strings
- String factorisations with maximum or minimum dimension
- Indeterminate string factorizations and degenerate text transformations
- A bijective variant of the Burrows-Wheeler transform using V-order
- String comparison and Lyndon-like factorization using V-order in linear time
- Combinatorics of unique maximal factorization families (UMFFs)
- A linear partitioning algorithm for hybrid Lyndons using \(V\)-order
- Generic Algorithms for Factoring Strings
- \(V\)-words, Lyndon words and substring circ-UMFFs
This page was built for publication: PROPERTIES AND CONSTRUCTION OF UNIQUE MAXIMAL FACTORIZATION FAMILIES FOR STRINGS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3526553)