A Framework for Dynamic Parameterized Dictionary Matching

  title={A Framework for Dynamic Parameterized Dictionary Matching},
  author={Arnab Ganguly and W. Hon and R. Shah},
  • 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
    8 Citations
    Parameterized Text Indexing with One Wildcard
    • 1
    Real-Time Streaming Multi-Pattern Search for Constant Alphabet
    • 11
    • PDF
    Parameterized Dictionary Matching with One Gap
    A brief history of parameterized matching problems
    • 4
    Dynamic Dictionary Matching in the Online Model
    • 1
    • PDF
    pBWT: Achieving Succinct Data Structures for Parameterized Pattern Matching and Related Problems
    • 15
    • PDF


    Succinct Dictionary Matching with No Slowdown
    • 46
    • PDF
    Dynamic Dictionary Matching
    • 101
    Compressed Index for Dictionary Matching
    • 34
    • PDF
    Improved dynamic dictionary matching
    • 104
    Dynamic Entropy-Compressed Sequences and Full-Text Indexes
    • 13
    • PDF
    Fully Functional Static and Dynamic Succinct Trees
    • 169
    • PDF