Generic algorithms for factoring strings

Authors:
David E. Daykin;Jacqueline W. Daykin;Costas S. Iliopoulos;W. F. Smyth
Affiliations:
Department of Mathematics, University of Reading, UK;Department of Computer Science, Royal Holloway, University of London, UK, Department of Informatics, Kings College London, UK;Department of Informatics, Kings College London, UK, Department of Mathematics & Statistics, University of Western Australia, Perth, Australia;Department of Informatics, Kings College London, UK, Department of Computing & Software, McMaster University, Canada, Department of Mathematics & Statistics, University of Western Australi ...
Venue:
Information Theory, Combinatorics, and Search Theory
Year:
2013

Citing 13
Cited 0

Two-way string-matching

Journal of the ACM (JACM)
An introduction to parallel algorithms

An introduction to parallel algorithms
Optimal algorithms for computing the canonical form of a circular string

Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
Infinite Lyndon words

Information Processing Letters
Parallel RAM algorithms for factorizing words

Theoretical Computer Science
Computation of words satisfying the "rhythmic oddity property" (after Simha Arom's works)

Information Processing Letters
Lyndon-like and V-order factorizations of strings

Journal of Discrete Algorithms
Periodic musical sequences and Lyndon words

Soft Computing - A Fusion of Foundations, Methodologies and Applications
A note on the Burrows-Wheeler transformation

Theoretical Computer Science
Lyndon + Christoffel = digitally convex

Pattern Recognition
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
Simple real-time constant-space string matching

CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we describe algorithms for factoring words over sets of strings known as circ-UMFFs, generalizations of the well-known Lyndon words based on lexorder, whose properties were first studied in 1958 by Chen, Fox and Lyndon. In 1983 Duval designed an elegant linear-time sequential (RAM) Lyndon factorization algorithm; a corresponding parallel (PRAM) algorithm was described in 1994 by Daykin, Iliopoulos and Smyth. In 2003 Daykin and Daykin introduced various circ-UMFFs, including one based on V-words and V-ordering; in 2011 linear string comparison and sequential factorization algorithms based on V-order were given by Daykin, Daykin and Smyth. Here we first describe generic RAM and PRAM algorithms for factoring a word over any circ-UMFF; then we show how to customize these generic algorithms to yield optimal parallel Lyndon-like V-word factorization.