Efficient Parallel And Serial Approximate String Matching by

@inproceedings{Landau1986EfficientPA,
  title={Efficient Parallel And Serial Approximate String Matching by},
  author={Gad M. Landau and Uzi Vishkin},
  year={1986}
}
Consider the string matching problem, where differences between characters of the pattern and characters of the text are allowed. Each difference is due to either a mismatch between a character of the text and a character of the pattern or a superfluous character in the text or a superfluous character in the pattern. Given a text of length n, a pattern of length m and an integer k, we present parallel and serial algorithms for finding all occurrences of the pattern in the text with at most k… CONTINUE READING