TY - JOUR
T1 - Enhanced string factoring from alphabet orderings
AU - Clare, Amanda
AU - Daykin, Jacqueline W.
N1 - Funding Information:
The authors were part-funded by the European Regional Development Fund through the Welsh Government, grant 80761-AU-137 (West).
Publisher Copyright:
© 2018 The Authors
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 -
