Enhanced string factoring from alphabet orderings
Authors
Organisations
| Type | Article |
|---|
| Original language | English |
|---|---|
| Pages (from-to) | 4-7 |
| Number of pages | 4 |
| Journal | Information Processing Letters |
| Volume | 143 |
| Early online date | 22 Oct 2018 |
| DOI | |
| Publication status | Published - 01 Mar 2019 |
| Permanent link | Permanent link |
|---|
Abstract
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.
Keywords
- alphabet ordering, combinatorial problems, design of algorithms, greedy algorithm, Lyndon factorization
Documents
- Enhanced string factoring from alphabet orderings
Final published version, 241 KB, PDF
Licence: CC BY Show licence