Edit and Alphabet-Ordering Sensitivity of Lex-parse

February 29, 2024 Β· Declared Dead Β· πŸ› International Symposium on Mathematical Foundations of Computer Science

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Yuto Nakashima, Dominik KΓΆppl, Mitsuru Funakoshi, Shunsuke Inenaga, Hideo Bannai arXiv ID 2402.19223 Category cs.DS: Data Structures & Algorithms Citations 1 Venue International Symposium on Mathematical Foundations of Computer Science Last Checked 4 months ago
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. 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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Data Structures & Algorithms

Died the same way β€” πŸ‘» Ghosted