V-words, Lyndon words and substring circ-UMFFs

DOI10.1007/978-3-031-49611-0_34MaRDI QIDQ6606210zbMATH OpenFDO

Authors Jacqueline W. Daykin, Neerja Mhaskar, W. F. Smyth

Publication date 16 September 2024

Full work available at URL https://doi.org/10.1007/978-3-031-49611-0_34

zbMATH Keywords

\(V\)-order\(V\)-Wordcirc-UMFFcombinatoricsfactorizationLyndon Wordsubstring circ-UMFFtotal orderUMFF

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites work

• V-order: new combinatorial properties \& a simple comparison algorithm
• A bijection between words and multisets of necklaces
• A bijective variant of the Burrows-Wheeler transform using V-order
• A linear partitioning algorithm for hybrid Lyndons using \(V\)-order
• Algorithms on Strings
• Binary block order Rouen transform
• Combinatorics of unique maximal factorization families (UMFFs)
• Computation of the suffix array, Burrows-Wheeler transform and FM-index in V-order
• Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform
• Factorizing words over an ordered alphabet
• Free differential calculus. IV: The quotient groups of the lower central series
• Generalized Lyndon words
• scientific article; zbMATH DE number 1146223 (Why is no real title available?)
• Indeterminate string factorizations and degenerate text transformations
• Lyndon-like and V-order factorizations of strings
• On generalized Lyndon words
• PROPERTIES AND CONSTRUCTION OF UNIQUE MAXIMAL FACTORIZATION FAMILIES FOR STRINGS
• Simple linear comparison of strings in V-order
• Simple linear comparison of strings in V-order (extended abstract)
• String comparison and Lyndon-like factorization using V-order in linear time
• The alternating BWT: an algorithmic perspective

This page was built for publication: \(V\)-words, Lyndon words and substring circ-UMFFs

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