Paper Info
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.
Year
DOI
Venue
2019
10.1016/j.ipl.2018.10.011
Information Processing Letters
Keywords
DocType
Volume
Alphabet ordering,Combinatorial problems,Design of algorithms,Greedy algorithm,Lyndon factorization
Journal
143
ISSN
Citations 
PageRank 
0020-0190
0
0.34
References 
Authors
4
2
Name
Order
Citations
PageRank
Amanda Clare159247.37
Jacqueline W. Daykin27914.68