Lyndon-like and V-order factorizations of strings
From MaRDI portal
Publication:1827280
DOI10.1016/S1570-8667(03)00039-XzbMATH Open1100.68087WikidataQ114120140 ScholiaQ114120140MaRDI QIDQ1827280FDOQ1827280
Authors: Jacqueline W. Daykin, David E. Daykin 
Publication date: 6 August 2004
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
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
lexicographic orderstringwordLyndon factorizationB-orderChen-Duval-Fox factorizationmaximal factorizationT-orderV-order
Cites Work
- Factorizing words over an ordered alphabet
- On Burnside's Problem
- Free differential calculus. IV: The quotient groups of the lower central series
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast parallel Lyndon factorization with applications
- Nonexistence of a Kruskal-Katona type theorem for subword orders
- On deleting coordinates from integer vectors
- Ordering Integer Vectors for Coordinate Deletions
- Title not available (Why is that?)
Cited In (17)
- \(V\)-words, Lyndon words and substring circ-UMFFs
- Inferring Strings from Lyndon Factorization
- Indeterminate string factorizations and degenerate text transformations
- \(V\)-order: new combinatorial properties \& a simple comparison algorithm
- Computation of the suffix array, Burrows-Wheeler transform and FM-index in \(V\)-order
- A linear partitioning algorithm for hybrid Lyndons using \(V\)-order
- PROPERTIES AND CONSTRUCTION OF UNIQUE MAXIMAL FACTORIZATION FAMILIES FOR 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)
- String comparison and Lyndon-like factorization using V-order in linear time
- Binary block order Rouen transform
- Generic Algorithms for Factoring Strings
- Enhanced string factoring from alphabet orderings
- A bijective variant of the Burrows-Wheeler transform using \(V\)-order
- 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)
