Papers
Topics
Authors
Recent
Search
2000 character limit reached

Parameterized Pattern Matching -- Succinctly

Published 24 Mar 2016 in cs.DS | (1603.07457v2)

Abstract: We consider the ParameterizedParameterized PatternPattern MatchingMatching problem, where a pattern PP matches some location in a text T\mathsf{T} iff there is a one-to-one correspondence between the alphabet symbols of the pattern to those of the text. More specifically, assume that the text T\mathsf{T} contains nn characters from a static alphabet Σs\Sigma_s and a parameterized alphabet Σp\Sigma_p, where Σs∩Σp=∅\Sigma_s \cap \Sigma_p = \varnothing and ∣Σs∪Σp∣=σ|\Sigma_s \cup \Sigma_p|=\sigma. A pattern PP matches a substring SS of T\mathsf{T} iff the static characters match exactly, and there exists a one-to-one function that renames the parameterized characters in SS to that in PP. Previous indexing solution [Baker, STOC 1993], known as ParameterizedParameterized SuffixSuffix TreeTree, requires Θ(nlog⁡n)\Theta(n\log n) bits of space, and can find all occocc occurrences of PP in O(∣P∣log⁡σ+occ)\mathcal{O}(|P|\log \sigma+ occ) time. In this paper, we present the first succinct index that occupies nlog⁡σ+O(n)n \log \sigma + \mathcal{O}(n) bits and answers queries in O((∣P∣+occ⋅log⁡n)log⁡σlog⁡log⁡σ)\mathcal{O}((|P|+ occ\cdot \log n) \log\sigma\log \log \sigma) time. We also present a compact index that occupies O(nlog⁡σ)\mathcal{O}(n\log\sigma) bits and answers queries in O(∣P∣log⁡σ+occ⋅log⁡n)\mathcal{O}(|P|\log \sigma+ occ\cdot \log n) time. Furthermore, the techniques are extended to obtain the first succinct representation of the index of Shibuya for StructuralStructural MatchingMatching [SWAT, 2000], and of Idury and Sch\"{a}ffer for ParameterizedParameterized DictionaryDictionary MatchingMatching [CPM, 1994].

Citations (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.