A linear partitioning algorithm for hybrid Lyndons using V-order
DOI10.1016/J.TCS.2012.02.001zbMATH Open1292.68130OpenAlexW2080616298MaRDI QIDQ390899FDOQ390899
Authors: Jacqueline W. Daykin, W. F. Smyth, David E. Daykin 
Publication date: 9 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.02.001
Recommendations
- String comparison and Lyndon-like factorization using V-order in linear time
- \(V\)-order: new combinatorial properties \& a simple comparison algorithm
- Generic Algorithms for Factoring Strings
- Lyndon-like and V-order factorizations of strings
- Applications of \(V\)-order: suffix arrays, the Burrows-Wheeler transform \& the FM-index
lexicographic orderconcatenationstring comparison\(V\)-orderfactorization algorithms\(V\)-wordalphabetcirc-UMFFhybrid Lyndon wordslinear-time RAM algorithmspartitioning algorithmtotal orderunique maximal factorization family (UMFF)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Factorizing words over an ordered alphabet
- Computation of words satisfying the ``rhythmic oddity property (after Simha Arom's works)
- Lyndon-like and V-order factorizations of strings
- String comparison and Lyndon-like factorization using V-order in linear time
- Combinatorics of unique maximal factorization families (UMFFs)
- Title not available (Why is that?)
- Optimal algorithms for computing the canonical form of a circular string
- Parallel RAM algorithms for factorizing words
- Periodic musical sequences and Lyndon words
- A note on the Burrows-Wheeler transformation
- Title not available (Why is that?)
- PROPERTIES AND CONSTRUCTION OF UNIQUE MAXIMAL FACTORIZATION FAMILIES FOR STRINGS
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generic Algorithms for Factoring Strings
- Free differential calculus. IV: The quotient groups of the lower central series
Cited In (10)
- A Linear Time Algorithm for Ordered Partition
- \(V\)-words, Lyndon words and substring circ-UMFFs
- \(V\)-order: new combinatorial properties \& a simple comparison algorithm
- Computation of the suffix array, Burrows-Wheeler transform and FM-index in \(V\)-order
- A survey of string orderings and their application to the Burrows-Wheeler transform
- Reconstructing a string from its Lyndon arrays
- String comparison and Lyndon-like factorization using V-order in linear time
- Lyndon-like and V-order factorizations of strings
- Generic Algorithms for Factoring Strings
- A bijective variant of the Burrows-Wheeler transform using \(V\)-order
Uses Software
This page was built for publication: A linear partitioning algorithm for hybrid Lyndons using \(V\)-order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q390899)
