Edit and Alphabet-Ordering Sensitivity of Lex-parse
<|reference_start|>Edit and Alphabet-Ordering Sensitivity of Lex-parse: 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.<|reference_end|>
@article{nakashima2024edit,
    title={Edit and Alphabet-Ordering Sensitivity of Lex-parse},
    author={Yuto Nakashima, Dominik K"oppl, Mitsuru Funakoshi, Shunsuke Inenaga,
  Hideo Bannai},
    journal={arXiv preprint arXiv:2402.19223},
    year={2024},
    archivePrefix={arXiv},
    eprint={2402.19223},
    primaryClass={cs.DS}
}