Enhanced string factoring from alphabet orderings

Amanda Clare; Jacqueline W. Daykin

doi:10.1016/j.ipl.2018.10.011

Enhanced string factoring from alphabet orderings

Amanda Clare, Jacqueline W. Daykin

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

4 Citations (SciVal)

159 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 language	English
Pages (from-to)	4-7
Number of pages	4
Journal	Information Processing Letters
Volume	143
Early online date	22 Oct 2018
DOIs	https://doi.org/10.1016/j.ipl.2018.10.011
Publication status	Published - 01 Mar 2019

Keywords

alphabet ordering
combinatorial problems
design of algorithms
greedy algorithm
Lyndon factorization

Access to Document

10.1016/j.ipl.2018.10.011Licence: CC BY

Enhanced string factoring from alphabet orderingsFinal published version, 241 KBLicence: CC BY

Permanent link

Persistent link

Amanda Clare
- afcaber.acuk
- Faculty of Business and Physcial Sciences, Department of Computer Science - Senior Lecturer
Person: Teaching And Research

Cite this

@article{a1b250b116124de18668228e39675d5b,

title = "Enhanced string factoring from alphabet orderings",

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",

author = "Amanda Clare and Daykin, {Jacqueline W.}",

year = "2019",

month = mar,

day = "1",

doi = "10.1016/j.ipl.2018.10.011",

language = "English",

volume = "143",

pages = "4--7",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

}

TY - JOUR

T1 - Enhanced string factoring from alphabet orderings

AU - Clare, Amanda

AU - Daykin, Jacqueline W.

PY - 2019/3/1

Y1 - 2019/3/1

N2 - 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.

AB - 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.

KW - alphabet ordering

KW - combinatorial problems

KW - design of algorithms

KW - greedy algorithm

KW - Lyndon factorization

U2 - 10.1016/j.ipl.2018.10.011

DO - 10.1016/j.ipl.2018.10.011

M3 - Article

SN - 0020-0190

VL - 143

SP - 4

EP - 7

JO - Information Processing Letters

JF - Information Processing Letters

ER -

Enhanced string factoring from alphabet orderings

Abstract

Keywords

Access to Document

Permanent link

Fingerprint

Profiles

Amanda Clare

Cite this