String comparison and Lyndon-like factorization using V-order in linear time

Authors:
David E. Daykin;Jacqueline W. Daykin;W. F. Smyth
Affiliations:
Department of Mathematics, University of Reading, UK;Department of Computer Science, Royal Holloway & King's College, University of London, UK and Centre for Stringology & Applications, Digital Ecosystems & Business Intelligence Institut ...;Algorithms Research Group, Department of Computing & Software, McMaster University, Hamilton, Ontario, Canada and Centre for Stringology & Applications, Digital Ecosystems & Business I ...
Venue:
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Year:
2011

Citing 6
Cited 2

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
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
STAR: an algorithm to Search for Tandem Approximate Repeats

Bioinformatics
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.00

Visualization

Abstract

In this paper we extend previous work on Unique Maximal Factorization Families (UMFFs) and a total (but non-lexicographic) ordering of strings called V-order. We describe linear-time algorithms for string comparison and Lyndon factorization based on V-order. We propose extensions of these algorithms to other forms of order.