A Framework for Dynamic Parameterized Dictionary Matching
@inproceedings{Ganguly2016AFF, title={A Framework for Dynamic Parameterized Dictionary Matching}, author={Arnab Ganguly and W. Hon and R. Shah}, booktitle={SWAT}, year={2016} }
Two equal-length strings S and S' are a parameterized-match (p-match) iff there exists a one-to-one function that renames the characters in S to those in S'. Let P be a collection of d patterns of total length n characters that are chosen from an alphabet Sigma of cardinality sigma. The task is to index P such that we can support the following operations.
* search(T): given a text T, report all occurrences such that there exists a pattern P_i in P that is a p-match with the substring T[j,j… CONTINUE READING
Topics from this paper
8 Citations
Parameterized Text Indexing with One Wildcard
- Mathematics, Computer Science
- 2019 Data Compression Conference (DCC)
- 2019
- 1
Real-Time Streaming Multi-Pattern Search for Constant Alphabet
- Mathematics, Computer Science
- ESA
- 2017
- 11
- PDF
A brief history of parameterized matching problems
- Mathematics, Computer Science
- Discret. Appl. Math.
- 2020
- 4
pBWT: Achieving Succinct Data Structures for Parameterized Pattern Matching and Related Problems
- Mathematics, Computer Science
- SODA
- 2017
- 15
- PDF
Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams
- Computer Science
- ICALP
- 2018
- 13
- PDF
Succinct Data Structures for Parameterized Pattern Matching and Related Problems
- Computer Science
- 2017
References
SHOWING 1-10 OF 37 REFERENCES
Compressed Index for Dictionary Matching
- Computer Science
- Data Compression Conference (dcc 2008)
- 2008
- 34
- PDF
Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
- Mathematics, Computer Science
- STOC '00
- 2000
- 207
- PDF
An Improved Query Time for Succinct Dynamic Dictionary Matching
- Mathematics, Computer Science
- CPM
- 2014
- 9