Enhanced string factoring from alphabet orderings

Research output: Working paper


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.
Original languageEnglish
Number of pages9
Publication statusPublished - 15 Jun 2018


Dive into the research topics of 'Enhanced string factoring from alphabet orderings'. Together they form a unique fingerprint.

Cite this