2026-07-24T01:19:43Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:20631 2024-08-23T05:50:30Z ddc:004 open_access

Edit and Alphabet-Ordering Sensitivity of Lex-Parse Nakashima, Yuto Köppl, Dominik Funakoshi, Mitsuru Inenaga, Shunsuke Bannai, Hideo Compression sensitivity Lex-parse Fibonacci words 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 (i.e., we show Θ(log n) bounds for strings of length n). 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Yuto Nakashima and Dominik Köppl and Mitsuru Funakoshi and Shunsuke Inenaga and Hideo Bannai 2024 Is Part Of LIPIcs, Volume 306, 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.MFCS.2024.75 urn:nbn:de:0030-drops-206314 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2024.75 eng https://creativecommons.org/licenses/by/4.0/legalcode