左端编辑下CDAWG敏感性的紧界
Tight bounds for the sensitivity of CDAWGs with left-end edits
AI总结:
本文研究左端单字符编辑(插入、删除、替换)下CDAWG大小的最坏情况增加,证明新边数不超过原边数$e$,并给出匹配或几乎匹配的下界,同时推广至向左在线构造,证明其需要$\Omega(n^2)$时间。
摘要:
紧凑有向无环词图(CDAWG)[Blumer等人,1987]是一种基于字符串的基础数据结构,应用于文本模式搜索、数据压缩和模式发现。直观上,字符串$T$的CDAWG是通过合并同一字符串$T$的后缀树[Weiner,1973]的同构子树而获得的,因此CDAWG是一种紧凑的索引结构。在本文中,我们研究了当在输入字符串$T$的左端执行单个字符编辑操作(插入、删除或替换)时CDAWG的敏感性,即我们关注左端编辑操作后CDAWG大小的最坏情况增加。我们证明,如果$e$是字符串$T$的CDAWG的边数,那么对$T$进行左端编辑操作后添加到CDAWG的新边数不超过$e$。此外,我们给出了左端插入下CDAWG敏感性的匹配下界,以及左端删除和替换的几乎匹配下界。然后,我们将左端插入的下界实例推广到CDAWG的向左在线构造,并证明对于某些长度为$n$的字符串,它需要$\Omega(n^2)$时间。
英文摘要:
Compact directed acyclic word graphs (CDAWGs) [Blumer et al. 1987] are a fundamental data structure on strings with applications in text pattern searching, data compression, and pattern discovery. Intuitively, the CDAWG of a string $T$ is obtained by merging isomorphic subtrees of the suffix tree [Weiner 1973] of the same string $T$, thus CDAWGs are a compact indexing structure. In this paper, we investigate the sensitivity of CDAWGs when a single character edit operation (insertion, deletion, or substitution) is performed at the left-end of the input string $T$, namely, we are interested in the worst-case increase in the size of the CDAWG after a left-end edit operation. We prove that if $e$ is the number of edges of the CDAWG for string $T$, then the number of new edges added to the CDAWG after a left-end edit operation on $T$ does not exceed $e$. Further, we present a matching lower bound on the sensitivity of CDAWGs for left-end insertions, and almost matching lower bounds for left-end deletions and substitutions. We then generalize our lower-bound instance for left-end insertions to leftward online construction of the CDAWG, and show that it requires $Ω(n^2)$ time for some string of length $n$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。