Problem
Research questions and friction points this paper is trying to address.
Inverse Lyndon Array
inverse Lyndon words
next greater suffix array
border-correction term
longest common extension (LCE)
The Inverse Lyndon Array
🤖 AI Summary
本文解决了逆Lyndon单词数组的构建问题，通过结合后缀数组和边界修正项，并利用线性时间算法实现了对逆Lyndon数组的有效计算。
📝 Abstract
The Lyndon array stores, at each position of a word, the length of the longest Lyndon factor starting at that position and plays an important role in combinatorics on words, for example, in the construction of fundamental data structures such as the suffix array. In this paper, we introduce the Inverse Lyndon array, the analogous structure for inverse Lyndon words, namely words that are lexicographically greater than all their proper nonempty suffixes. Unlike standard Lyndon words, inverse Lyndon words may have non-trivial borders, which introduces a genuine theoretical difficulty. We show that the Inverse Lyndon array can be characterized in terms of the next greater suffix array together with a border-correction term, and we prove that this correction coincides with a longest common extension (LCE) value. Building on this characterization, we adapt the nearest-suffix framework underlying Ellert's linear-time construction of the Lyndon array to the inverse setting, obtaining an O(n)-time algorithm for general ordered alphabets. Finally, we show that the Inverse Lyndon array can also be used to reconstruct the canonical inverse Lyndon factorization in linear time.
Innovation
Methods, ideas, or system contributions that make the work stand out.
Inverse Lyndon array
next greater suffix array
border-correction term
longest common extension (LCE)
canonical inverse Lyndon factorization
🔎 Similar Papers
No similar papers found.
