Compressed Consecutive Pattern Matching † .

Pawel Gawrychowski,Garance Gourdel,Tatiana Starikovskaya,Teresa Anna Steiner

Data Compression Conference（2024）

引用 0|浏览3

暂无评分

摘要

Originating from the work of Navarro and Thankachan [TCS 2016], the problem of consecutive pattern matching is a variant of the fundamental pattern matching problem, where one is given a text and a pair of patterns, and must compute their consecutive occurrences in the text. Assuming that the text is given as a straight-line program, we develop an algorithm that computes all consecutive occurrences in optimal time.

查看译文

关键词

Pattern Matching,Variant Of Problem,Time Constant,Occurrence Patterns,Substring,Secondary Information,Boundary Information,Query Time,Parse Tree,Alphabet Size,Context-free Grammar

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要