Edit and Alphabet-Ordering Sensitivity of Lex-parse
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866911873897594880 |
|---|---|
| author | Nakashima, Yuto Köppl, Dominik Funakoshi, Mitsuru Inenaga, Shunsuke Bannai, Hideo |
| author_facet | Nakashima, Yuto Köppl, Dominik Funakoshi, Mitsuru Inenaga, Shunsuke Bannai, Hideo |
| contents | We investigate the compression sensitivity [Akagi et al., 2023] of lex-parse [Navarro et al., 2021] for two operations: (1) single character edit and (2) modification of the alphabet ordering, and give tight upper and lower bounds for both operations. For both lower bounds, we use the family of Fibonacci words. For the bounds on edit operations, our analysis makes heavy use of properties of the Lyndon factorization of Fibonacci words to characterize the structure of lex-parse. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_19223 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Edit and Alphabet-Ordering Sensitivity of Lex-parse Nakashima, Yuto Köppl, Dominik Funakoshi, Mitsuru Inenaga, Shunsuke Bannai, Hideo Data Structures and Algorithms We investigate the compression sensitivity [Akagi et al., 2023] of lex-parse [Navarro et al., 2021] for two operations: (1) single character edit and (2) modification of the alphabet ordering, and give tight upper and lower bounds for both operations. For both lower bounds, we use the family of Fibonacci words. For the bounds on edit operations, our analysis makes heavy use of properties of the Lyndon factorization of Fibonacci words to characterize the structure of lex-parse. |
| title | Edit and Alphabet-Ordering Sensitivity of Lex-parse |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2402.19223 |