A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf
.
Introducing efficient parallelism into approximate string matching and a new serial algorithm
1986
Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86
Consider the stnng 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
doi:10.1145/12130.12152
dblp:conf/stoc/LandauV86
fatcat:hjn7yfok5ve75dkorw4mf3yfve