Enhanced string factoring from alphabet orderings

DOI10.1016/j.ipl.2018.10.011zbMath1478.68459arXiv1806.05942OpenAlexW2808133657WikidataQ129058903 ScholiaQ129058903MaRDI QIDQ1711413

Jacqueline W. Daykin, Amanda Clare

Publication date: 18 January 2019

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1806.05942

zbMATH Keywords

greedy algorithmcombinatorial problemsdesign of algorithmsLyndon factorizationalphabet ordering

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cites Work

• Suffix array and Lyndon factorization of a text
• Reconstructing a string from its Lyndon arrays
• Factorizing words over an ordered alphabet
• Combinatorics of Unique Maximal Factorization Families (UMFFs)
• PROPERTIES AND CONSTRUCTION OF UNIQUE MAXIMAL FACTORIZATION FAMILIES FOR STRINGS
• Free differential calculus. IV: The quotient groups of the lower central series

This page was built for publication: Enhanced string factoring from alphabet orderings