Sorting suffixes of a text via its Lyndon Factorization

TL;DR

This paper introduces a novel method for sorting text suffixes using Lyndon factorization, ensuring local suffix order preservation, which can be adapted to various implementations in text processing.

Contribution

The paper presents a new Lyndon factorization-based approach for suffix sorting that maintains local suffix order, offering versatility for different implementation scenarios.

Findings

Preserves local suffix order within Lyndon factors

Applicable to multiple text processing scenarios

Potentially improves efficiency of suffix sorting

Abstract

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.