#### Filter Results:

#### Publication Year

2007

2015

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

- Benny Porat, Ely Porat
- FOCS
- 2009

1. Summary. The authors proposed an on-line randomized algorithm for the pattern matching problem, that consists in reporting all the positions where a given pattern p, of length m, occurs in a text t. As a major contribution the paper illustrate an algorithm that solves the pattern matching problem (w.h.p) requiring only O(log m) space, which is a… (More)

We present a deterministic black box solution for online approximate matching. Given a pattern of length m and a streaming text of length n that arrives one character at a time, the task is to report the distance between the pattern and a sliding window of the text as soon as the new character arrives. Our solution requires O(Σ log 2 m j=1 T (n, 2 j−1)/n)… (More)

We study the problem of parameterized matching in a stream where we want to output matches between a pattern of length m and the last m symbols of the stream before the next symbol arrives. Parameterized matching is a natural generalisation of exact matching where an arbitrary one-to-one relabelling of pattern symbols is allowed. We show how this problem… (More)

We consider a class of pattern matching problems where a normalising transformation is applied at every alignment. Normalised pattern matching plays a key role in fields as diverse as image processing and musical information processing where application specific transformations are often applied to the input. By considering the class of polynomial… (More)

We consider the well known problem of pattern matching under the Hamming distance. Previous approaches have shown how to count the number of mismatches efficiently especially, when a bound is known for the maximum Hamming distance. Our interest is different in that we wish collect a random sample of mismatches of fixed size at each position in the text.… (More)