In-Place BWT and Lyndon Array Construction in Constant Space
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909975263051776 |
|---|---|
| author | Louza, Felipe A. Lefebvre, Arnaud |
| author_facet | Louza, Felipe A. Lefebvre, Arnaud |
| contents | We present an extension of the in-place BWT algorithm of Crochemore et al. [8] that enables the construction of the Lyndon array using O(1) extra space. Our approach incrementally maintains the lexicographic ranks of the suffixes during the right-to-left BWT construction and then derives the Lyndon array through a simple next-smaller-value procedure. Although not intended for practical use due to its quadratic running time, the method is conceptually simple and works for unbounded alphabets. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_20869 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | In-Place BWT and Lyndon Array Construction in Constant Space Louza, Felipe A. Lefebvre, Arnaud Data Structures and Algorithms We present an extension of the in-place BWT algorithm of Crochemore et al. [8] that enables the construction of the Lyndon array using O(1) extra space. Our approach incrementally maintains the lexicographic ranks of the suffixes during the right-to-left BWT construction and then derives the Lyndon array through a simple next-smaller-value procedure. Although not intended for practical use due to its quadratic running time, the method is conceptually simple and works for unbounded alphabets. |
| title | In-Place BWT and Lyndon Array Construction in Constant Space |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2512.20869 |