Show simple item record Clare, Amanda Daykin, Jacqueline 2018-11-16T19:34:42Z 2018-11-16T19:34:42Z 2018-10-22
dc.identifier.citation Clare , A & Daykin , J 2018 , ' Enhanced string factoring from alphabet orderings ' Information Processing Letters . DOI: 10.1016/j.ipl.2018.10.011 en
dc.identifier.issn 0020-0190
dc.identifier.other PURE: 28368364
dc.identifier.other PURE UUID: a1b250b1-1612-4de1-8668-228e39675d5b
dc.description.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. en
dc.language.iso eng
dc.relation.ispartof Information Processing Letters en
dc.rights en
dc.subject alphabet ordering en
dc.subject combinatorial problems en
dc.subject design of algorithms en
dc.subject greedy algorithm en
dc.subject Lyndon factorization en
dc.title Enhanced string factoring from alphabet orderings en
dc.type /dk/atira/pure/researchoutput/researchoutputtypes/contributiontojournal/article en
dc.description.version proof en
dc.contributor.institution Department of Computer Science en
dc.description.status Peer reviewed en

Files in this item

Aside from theses and in the absence of a specific licence document on an item page, all works in Cadair are accessible under the CC BY-NC-ND Licence. AU theses and dissertations held on Cadair are made available for the purposes of private study and non-commercial research and brief extracts may be reproduced under fair dealing for the purpose of criticism or review. If you have any queries in relation to the re-use of material on Cadair, contact

This item appears in the following Collection(s)

Show simple item record

Search Cadair

Advanced Search