Lyndon-like and V-order factorizations of strings

DOI10.1016/S1570-8667(03)00039-XzbMath1100.68087WikidataQ114120140 ScholiaQ114120140MaRDI QIDQ1827280

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 order; string; word; Lyndon factorization; B-order; Chen-Duval-Fox factorization; maximal factorization; T-order; V-order

Mathematics Subject Classification ID

68R15: Combinatorics on words

Related Items

Generic Algorithms for Factoring Strings, \(V\)-order: new combinatorial properties \& a simple comparison algorithm, A linear partitioning algorithm for hybrid Lyndons using \(V\)-order, Binary block order Rouen transform, Reconstructing a string from its Lyndon arrays, A survey of string orderings and their application to the Burrows-Wheeler transform, Computation of the suffix array, Burrows-Wheeler transform and FM-index in \(V\)-order, Indeterminate string factorizations and degenerate text transformations, A bijective variant of the Burrows-Wheeler transform using \(V\)-order, String Comparison and Lyndon-Like Factorization Using V-Order in Linear Time, PROPERTIES AND CONSTRUCTION OF UNIQUE MAXIMAL FACTORIZATION FAMILIES FOR STRINGS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonexistence of a Kruskal-Katona type theorem for subword orders
• Optimal canonization of all substrings of a string
• Optimal algorithms for computing the canonical form of a circular string
• Parallel RAM algorithms for factorizing words
• Factorizing words over an ordered alphabet
• Fast parallel Lyndon factorization with applications
• Ordering Integer Vectors for Coordinate Deletions
• On Burnside's Problem
• Free differential calculus. IV: The quotient groups of the lower central series
• On deleting coordinates from integer vectors