Enhanced string factoring from alphabet orderings

Authors Organisations
Type Article
Original languageEnglish
Pages (from-to)4-7
Number of pages4
JournalInformation Processing Letters
Early online date22 Oct 2018
Publication statusPublished - 01 Mar 2019
Permanent link
Show download statistics
View graph of relations
Citation formats


In this note we consider the concept of alphabet ordering in the context of string factoring. We propose a greedy algorithm that produces Lyndon factorizations with small numbers of factors which can be modified to produce large numbers of factors. For the technique we introduce the Exponent Parikh vector. Applications and research directions derived from circ-UMFFs are discussed.


  • alphabet ordering, combinatorial problems, design of algorithms, greedy algorithm, Lyndon factorization