Enhanced string factoring from alphabet orderings

Research output: Contribution to journalArticlepeer-review

5 Citations (SciVal)
187 Downloads (Pure)

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.
Original languageEnglish
Pages (from-to)4-7
Number of pages4
JournalInformation Processing Letters
Volume143
Early online date22 Oct 2018
DOIs
Publication statusPublished - 01 Mar 2019

Keywords

  • Alphabet ordering
  • Combinatorial problems
  • Design of algorithms
  • Greedy algorithm
  • Lyndon factorization

Fingerprint

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

Cite this