基于Lyndon分解的文本后缀排序
Sorting suffixes of a text via its Lyndon Factorization
摘要：
文本后缀排序过程在文本算法中发挥着基础作用。例如，它们被用于Burrows-Wheeler变换和后缀数组的构造，广泛用于计算机科学的几个领域。为此，最近的一些研究一直致力于寻找新的策略，以获得有效的方法，这样的排序。在本文中，我们介绍了一种新的方法，其中一个重要的作用是由林登因子分解，使局部后缀内的因素，这种因子分解检测保持其相互顺序时，扩展到整个词的后缀。这个属性表明了一种通用的技术，可以很容易地适应不同的实现方案。
英文摘要：
The process of sorting the suffixes of a text plays a fundamental role in Text Algorithms. They are used for instance in the constructions of the Burrows-Wheeler transform and the suffix array, widely used in several fields of Computer Science. For this reason, several recent researches have been devoted to finding new strategies to obtain effective methods for such a sorting. In this paper we introduce a new methodology in which an important role is played by the Lyndon factorization, so that the local suffixes inside factors detected by this factorization keep their mutual order when extended to the suffixes of the whole word. This property suggests a versatile technique that easily can be adapted to different implementative scenarios.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
