Algorithms for the Lyndon unique maximal factorization

MaRDI QIDQ3089218zbMATH OpenFDO

Authors David E. Daykin

Publication date 24 August 2011

zbMATH Keywords

algorithmcomplexityfactorizationLyndon wordstring

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Combinatorics of unique maximal factorization families (UMFFs)
• Generic Algorithms for Factoring Strings
• Inferring Strings from Lyndon Factorization
• Lyndon factorization algorithms for small alphabets and run-length encoded strings
• Factorizing words over an ordered alphabet

Cited in

(7)

• 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)
• PROPERTIES AND CONSTRUCTION OF UNIQUE MAXIMAL FACTORIZATION FAMILIES FOR STRINGS
• A linear partitioning algorithm for hybrid Lyndons using \(V\)-order
• Generic Algorithms for Factoring Strings
• Binary block order Rouen transform

This page was built for publication: Algorithms for the Lyndon unique maximal factorization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3089218)