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

Cyfrifiadureg

Allbwn ymchwil: Cyfraniad at gyfnodolyn › Erthygl › adolygiad gan gymheiriaid

4 Dyfyniadau(SciVal)

162 Wedi eu Llwytho i Lawr (Pure)

Crynodeb

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.

Iaith wreiddiol	Saesneg
Tudalennau (o-i)	4-7
Nifer y tudalennau	4
Cyfnodolyn	Information Processing Letters
Cyfrol	143
Dyddiad ar-lein cynnar	22 Hyd 2018
Dynodwyr Gwrthrych Digidol (DOIs)	https://doi.org/10.1016/j.ipl.2018.10.011
Statws	Cyhoeddwyd - 01 Maw 2019

Mynediad at Ddogfen

10.1016/j.ipl.2018.10.011Trwydded: CC BY

Enhanced string factoring from alphabet orderingsFersiwn derfynol wedi’i chyhoeddi, 241 KBTrwydded: CC BY

Cysylltiad parhaol

Dolen barhaus

Ffeiliau eraill a chysylltiadau

Dolen i’r cyhoeddiad yn Scopus

Amanda Clare
- afcaber.acuk
- Cyfadran Busnes a’r Gwyddorau Ffisegol, Cyfrifiadureg - Senior Lecturer
Unigolyn: Dysgu ac Ymchwil

Dyfynnu hyn

@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.}",

note = "Funding Information: The authors were part-funded by the European Regional Development Fund through the Welsh Government, grant 80761-AU-137 (West). Publisher Copyright: {\textcopyright} 2018 The Authors",

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

UR - http://www.scopus.com/inward/record.url?scp=85056426117&partnerID=8YFLogxK

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

Crynodeb

Mynediad at Ddogfen

Cysylltiad parhaol

Ffeiliau eraill a chysylltiadau

Ôl bys

Proffiliau

Amanda Clare

Dyfynnu hyn