Practical Evaluation of Lyndon Factors via Alphabet Reordering
Open Access
- 27 December 2022
- journal article
- research article
- Published by MDPI AG in Mathematics
- Vol. 11 (1) , 139
Abstract
We evaluate the influence of different alphabet orderings on the Lyndon factorization of a string. Experiments with Pizza&Chili datasets show that for most alphabet reorderings, the number of Lyndon factors is usually small, and the length of the longest Lyndon factor can be as large as the input string, which is unfavorable for algorithms and indexes that depend on the number of Lyndon factors. We present results with randomized alphabet permutations that can be used as a baseline to assess the effectiveness of heuristics and methods designed to modify the Lyndon factorization of a string via alphabet reordering.Keywords
All Related Versions
Funding Information
- Conselho Nacional de Desenvolvimento Científico e Tecnológico (406418/2021-7, APQ-01217-22)
- Fundação de Amparo à Pesquisa do Estado de Minas Gerais (406418/2021-7, APQ-01217-22)
This publication has 9 references indexed in Scilit:
- Evolutionary search techniques for the Lyndon factorization of biosequences2019
- Enhanced string factoring from alphabet orderingsInformation Processing Letters, 2019
- Extended suffix array construction using Lyndon factorsSādhanā, 2018
- Handbook of Enumerative Combinatorics2015
- Suffix array and Lyndon factorization of a textJournal of Discrete Algorithms, 2014
- Combinatorics on Words1997
- Suffix Arrays: A New Method for On-Line String SearchesSIAM Journal on Computing, 1993
- Factorizing words over an ordered alphabetJournal of Algorithms, 1983
- Free Differential Calculus, IV. The Quotient Groups of the Lower Central SeriesAnnals of Mathematics, 1958