The authors investigate the compression sensitivity of lex-parse for edit operations and alphabet ordering, providing tight upper and lower bounds for both scenarios.
Lex-parse sensitivity to edit operations and alphabet ordering is analyzed using Fibonacci words.
Lex-parse sensitivity to edit operations and alphabet ordering is analyzed using Fibonacci words, revealing tight upper and lower bounds.