Edit and Alphabet-Ordering Sensitivity of Lex-Parse

Yuto Nakashima, Dominik Köppl, Mitsuru Funakoshi, Shunsuke Inenaga, Hideo Bannai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publication49th International Symposium on Mathematical Foundations of Computer Science, MFCS 2024
EditorsRastislav Kralovic, Antonin Kucera
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959773355
DOIs
Publication statusPublished - Aug 2024
Event49th International Symposium on Mathematical Foundations of Computer Science, MFCS 2024 - Bratislava, Slovakia
Duration: Aug 26 2024Aug 30 2024

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume306
ISSN (Print)1868-8969

Conference

Conference49th International Symposium on Mathematical Foundations of Computer Science, MFCS 2024
Country/TerritorySlovakia
CityBratislava
Period8/26/248/30/24

All Science Journal Classification (ASJC) codes

  • Software

Fingerprint

Dive into the research topics of 'Edit and Alphabet-Ordering Sensitivity of Lex-Parse'. Together they form a unique fingerprint.

Cite this