Centrala begrepp
Investigating the sensitivity of CDAWGs to left-end edit operations reveals tight bounds and complexities.
Sammanfattning
The study focuses on the sensitivity of Compact Directed Acyclic Word Graphs (CDAWGs) to left-end edit operations. It explores the impact of single character insertions, deletions, and substitutions at the left end of input strings on the size and structure of CDAWGs. The research provides insights into the worst-case increase in CDAWG size after such edit operations, presenting upper and lower bounds for sensitivity. By analyzing various scenarios and constructing examples, the study demonstrates how these operations affect the edges, nodes, and overall complexity of CDAWGs.
Statistik
e(T) = 2m + 3
e(T') = 4m + 5
e(T') - e(T) = 8 (left-end insertion)
e(T') - e(T) = 5 (left-end deletion)
e(T') - e(T) = 6 (left-end substitution)