Lyndon-like and V-order factorizations of strings

DOI10.1016/S1570-8667(03)00039-XMaRDI QIDQ1827280zbMATHWikidataFDO

Authors Jacqueline W. Daykin, David E. Daykin

Publication date 6 August 2004

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

zbMATH Keywords

lexicographic orderstringwordLyndon factorizationB-orderChen-Duval-Fox factorizationmaximal factorizationT-orderV-order

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• PROPERTIES AND CONSTRUCTION OF UNIQUE MAXIMAL FACTORIZATION FAMILIES FOR STRINGS
• String comparison and Lyndon-like factorization using V-order in linear time
• Combinatorics of unique maximal factorization families (UMFFs)
• A linear partitioning algorithm for hybrid Lyndons using \(V\)-order
• Generic Algorithms for Factoring Strings

Cites work

• scientific article; zbMATH DE number 3811868 (Why is no real title available?)
• scientific article; zbMATH DE number 3914379 (Why is no real title available?)
• scientific article; zbMATH DE number 68337 (Why is no real title available?)
• scientific article; zbMATH DE number 1146223 (Why is no real title available?)
• scientific article; zbMATH DE number 1146224 (Why is no real title available?)
• Factorizing words over an ordered alphabet
• Fast parallel Lyndon factorization with applications
• Free differential calculus. IV: The quotient groups of the lower central series
• Nonexistence of a Kruskal-Katona type theorem for subword orders
• On Burnside's Problem
• On deleting coordinates from integer vectors
• Optimal algorithms for computing the canonical form of a circular string
• Optimal canonization of all substrings of a string
• Ordering Integer Vectors for Coordinate Deletions
• Parallel RAM algorithms for factorizing words

Cited in

(18)

• PROPERTIES AND CONSTRUCTION OF UNIQUE MAXIMAL FACTORIZATION FAMILIES FOR STRINGS
• Inferring Strings from Lyndon Factorization
• Computation of the suffix array, Burrows-Wheeler transform and FM-index in \(V\)-order
• Generic Algorithms for Factoring Strings
• A survey of string orderings and their application to the Burrows-Wheeler transform
• Reconstructing a string from its Lyndon arrays
• Combinatorics of unique maximal factorization families (UMFFs)
• A linear partitioning algorithm for hybrid Lyndons using \(V\)-order
• \(V\)-words, Lyndon words and substring circ-UMFFs
• Indeterminate string factorizations and degenerate text transformations
• String comparison and Lyndon-like factorization using V-order in linear time
• Analyzing strings with ordered Lyndon-like structures
• Enhanced string factoring from alphabet orderings
• \(V\)-order: new combinatorial properties \& a simple comparison algorithm
• A bijective variant of the Burrows-Wheeler transform using \(V\)-order
• Binary block order Rouen transform
• Lyndon factorization algorithms for small alphabets and run-length encoded strings
• String factorisations with maximum or minimum dimension

This page was built for publication: Lyndon-like and V-order factorizations of strings

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