Sorting suffixes of a text via its Lyndon factorization

Risultato della ricerca: Otherpeer review

8 Citazioni (Scopus)

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.
Lingua originaleEnglish
Pagine119-127
Numero di pagine9
Stato di pubblicazionePublished - 2013

All Science Journal Classification (ASJC) codes

  • ???subjectarea.asjc.2600.2600???

Fingerprint Entra nei temi di ricerca di 'Sorting suffixes of a text via its Lyndon factorization'. Insieme formano una fingerprint unica.

Cita questo