Pattern matching in pseudo real-time

  title={Pattern matching in pseudo real-time},
  author={Rapha{\"e}l Clifford and Benjamin Sach},
  journal={J. Discrete Algorithms},
It has recently been shown how to construct online, non-amortised approximate pattern matching algorithms for a class of problems whose distance functions can be classified as being local. Informally, a distance function is said to be local if for a pattern P of length m and any substring T [i, i+m−1] of a text T , the distance between P and T [i, i+m− 1… CONTINUE READING