• DOI:10.4230/LIPIcs.SWAT.2016.10
Corpus ID: 7475407

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}
}

Arnab Ganguly, W. Hon, R. Shah

Published in SWAT 2016

Mathematics, Computer Science

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

View via Publisher

drops.dagstuhl.de

Save to Library

Create Alert

Cite

Launch Research Feed