Combinatorics of Unique Maximal Factorization Families (UMFFs)

Authors:
David E. Daykin;Jacqueline W. Daykin;W. F. (Bill) Smyth
Affiliations:
Department of Mathematics University of Reading, UK;Department of Computer Science Royal Holloway & King's College, University of London, UK. E-mail: J.Daykin@cs.rhul.ac.uk, jackie.daykin@kcl.ac.uk;Algorithms Research Group, Department of Computing & Software, McMaster University, Hamilton ON L8S 4K1, Canada and Digital Ecosystems and Business Intelligence Institute Curtin University, GPO Bo ...
Venue:
Fundamenta Informaticae - Special Issue on Stringology
Year:
2009

Citing 6
Cited 3

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
A division property of the Fibonacci word

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

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

CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
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

A repeat in a string is a substring that occurs more than once. A repeat is extendible if every occurrence of the repeat has an identical letter either on the left or on the right; otherwise, it is maximal. A multirepeat is a repeat that occurs at least ...