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.
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference15 articles.
1. Smyth, W. (2003). Computing Patterns in Strings, Pearson Education.
2. Free differential calculus. IV—The quotient groups of the lower central series;Chen;Ann. Math.,1958
3. Lothaire, M. (1997). Combinatorics on Words, Cambridge Mathematical Library, Cambridge University Press. [2nd ed.].
4. Bona, M. (2015). Handbook of Enumerative Combinatorics, Discrete Mathematics and Its Applications, CRC Press.
5. Suffix array and Lyndon factorization of a text;Mantaci;J. Discret. Algorithms,2014
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献