Analyzing strings with ordered Lyndon-like structures

MaRDI QIDQ5169577zbMATH OpenFDO

Authors Jacqueline W. Daykin, W. F. Smyth

Publication date 10 July 2014

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Recommendations

• A linear partitioning algorithm for hybrid Lyndons using \(V\)-order
• String comparison and Lyndon-like factorization using V-order in linear time
• Applications of \(V\)-order: suffix arrays, the Burrows-Wheeler transform \& the FM-index
• Lyndon-like and V-order factorizations of strings
• Generic Algorithms for Factoring Strings

Cited in

(1)

• Inferring Strings from Lyndon Factorization

This page was built for publication: Analyzing strings with ordered Lyndon-like structures

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