Enhanced string factoring from alphabet orderings
Data Structures and Algorithms
2018-06-18 v1
Abstract
In this note we consider the concept of alphabet ordering in the context of string factoring. We propose a greedy-type algorithm which produces Lyndon factorizations with small numbers of factors along with a modification for large numbers of factors. For the technique we introduce the Exponent Parikh vector. Applications and research directions derived from circ-UMFFs are discussed.
Keywords
Cite
@article{arxiv.1806.05942,
title = {Enhanced string factoring from alphabet orderings},
author = {Amanda Clare and Jacqueline W. Daykin},
journal= {arXiv preprint arXiv:1806.05942},
year = {2018}
}
Comments
9 pages