Lyndon-like and V-order factorizations of strings

Authors:
David E. Daykin;Jacqueline W. Daykin
Affiliations:
Department of Mathematics, University of Reading, UK;Department of Computer Science, Royal Holloway, University of London, UK
Venue:
Journal of Discrete Algorithms
Year:
2003

Citing 4
Cited 5

Optimal canonization of all substrings of a string

Information and Computation
Optimal algorithms for computing the canonical form of a circular string

Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
Parallel RAM algorithms for factorizing words

Theoretical Computer Science
On deleting coordinates from integer vectors

Discrete Mathematics

Combinatorics of Unique Maximal Factorization Families (UMFFs)

Fundamenta Informaticae - Special Issue on Stringology
String comparison and Lyndon-like factorization using V-order in linear time

CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Combinatorics of Unique Maximal Factorization Families (UMFFs)

Fundamenta Informaticae - Special Issue on Stringology
A linear partitioning algorithm for Hybrid Lyndons using V-order

Theoretical Computer Science
Generic algorithms for factoring strings

Information Theory, Combinatorics, and Search Theory

Quantified Score

Hi-index	0.01

Visualization

Abstract

We say a family W of strings is an UMFF if every string has a unique maximal factorization over W. Then W is an UMFF iff xy, yz ∈ W and y non-empty imply xyz ∈ W. Let L-order denote lexicographic order. Danh and Daykin discovered V-order, B-order and T-order. Let R be L, V, B or T. Then we call r an R-word if it is strictly first in R-order among the cyclic permutations of r. The set of R-words form an UMFF. We show a large class of B-like UMFF. The well-known Lyndon factorization of Chen, Fox and Lyndon is the L case, and it motivated our work.