Simple linear comparison of strings in V-order

DOI10.3233/FI-2015-1228MaRDI QIDQ2805461zbMATHOpenAlexFDO

Authors Ali Alatabbi, Jacqueline W. Daykin, M. Sohel Rahman, W. F. Smyth

Publication date 11 May 2016

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2015-1228

zbMATH Keywords

Lyndon wordcomplexitydata structurelexicographic order\(V\)-orderarraytotal orderlinked listlinear comparison

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• Simple linear comparison of strings in \(V\)-order (extended abstract)
• V-order: new combinatorial properties \& a simple comparison algorithm
• String comparison and Lyndon-like factorization using V-order in linear time
• A linear partitioning algorithm for hybrid Lyndons using \(V\)-order
• Applications of \(V\)-order: suffix arrays, the Burrows-Wheeler transform \& the FM-index

Cited in

(7)

• 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
• \(V\)-words, Lyndon words and substring circ-UMFFs
• String comparison and Lyndon-like factorization using V-order in linear time
• \(V\)-order: new combinatorial properties \& a simple comparison algorithm
• Simple linear comparison of strings in \(V\)-order (extended abstract)
• Comparing Degenerate Strings

This page was built for publication: Simple linear comparison of strings in \(V\)-order

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