Dictionary Matching with One Gap*

Here, every dictionary subpattern is a single character with unbounded gaps between them.

Parameters

  • nn: length of text
  • ∣Σ∣|\Sigma|: size of alphabet
  • dd: number of patterns
  • mm: (max) pattern length

Related Problems

Insufficient data to display graph

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Insuffient Data to display table

Reductions Table

Displaying 3 of 3 reductions

Other relevant algorithms

Insuffient Data to display table