A Simple Grammar-Based Index for Finding Approximately Longest Common Substrings.

SPIRE(2023)

引用 0|浏览4
暂无评分
摘要
We show how, given positive constants and , and an -balanced straight-line program with g rules for a text T [1.. n ], we can build an O ( g )-space index that, given a pattern P [1.. m ], in time finds w.h.p. a substring of P that occurs in T and whose length is at least a fraction of the longest common substring of P and T . The correctness can be ensured within the same expected query time.
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络