PROPERTIES AND CONSTRUCTION OF UNIQUE MAXIMAL FACTORIZATION FAMILIES FOR STRINGS
From MaRDI portal
Publication:3526553
DOI10.1142/S0129054108006133zbMath1155.68063MaRDI QIDQ3526553
David E. Daykin, Jacqueline W. Daykin
Publication date: 25 September 2008
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Related Items
Indeterminate string factorizations and degenerate text transformations ⋮ A linear partitioning algorithm for hybrid Lyndons using \(V\)-order ⋮ Reconstructing a string from its Lyndon arrays ⋮ Enhanced string factoring from alphabet orderings ⋮ A bijective variant of the Burrows-Wheeler transform using \(V\)-order ⋮ String Comparison and Lyndon-Like Factorization Using V-Order in Linear Time ⋮ Generic Algorithms for Factoring Strings
Cites Work
- Unnamed Item
- A public key cryptosystem based on Lyndon words
- Parallel RAM algorithms for factorizing words
- Toward a formal study of jazz chord sequences generated by Steedman's grammar
- Lyndon-like and V-order factorizations of strings
- Factorizing words over an ordered alphabet
- Algorithms on Strings, Trees and Sequences
