当前位置: X-MOL 学术Theor. Comput. Sci. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Towards a real time algorithm for parameterized longest common prefix computation
Theoretical Computer Science ( IF 0.9 ) Pub Date : 2020-11-19 , DOI: 10.1016/j.tcs.2020.11.023
Amihood Amir , Eitan Kondratovsky

Parameterized matching has proven to be an efficient and useful tool for detecting code duplications. This paper presents a technique for calculating parameterized Longest Common Prefix (plcp) in constant time based on the knowledge about the plcp of the following suffixes. Using this technique, online p-suffix tree construction can be done in worst case time O(logn) per input symbol. Searching for a pattern of length m in the resulting suffix tree takes O(min{mlog(|Σ|+|Π|),m+logn}+mτΠ+tocc) time, where tocc is the number of occurrences of the pattern, and τΠ depends on Π. For constant-sized Π, τΠ=1, for polynomial-sized Π, τΠ=loglog|Π|, and for unbounded Π, τΠ=log|Π|.



中文翻译:

迈向用于参数化最长公共前缀计算的实时算法

事实证明,参数化匹配是检测代码重复的有效工具。本文提出了一种计算参数化的最长公共前缀(pCp基于有关pCp以下后缀。使用此技术,可以在最坏的情况下完成在线p后缀树的构建Ø日志ñ每个输入符号。在结果后缀树中搜索长度为m的模式需要Ø{日志|Σ|+|Π|+日志ñ}+τΠ+ŤØCC 时间,地点 ŤØCC 是模式的出现次数,并且 τΠ取决于Π。对于恒定大小的Π,τΠ=1个,对于多项式大小的Π, τΠ=日志日志|Π|,对于无界Π, τΠ=日志|Π|

更新日期:2020-12-13
down
wechat
bug