254 search results - page 6 / 51 » Multiple Approximate String Matching |
ICDAR
1999
IEEE
15 years 3 months ago
1999
IEEE
Abstract
104
click to vote
IWOCA
2009
Springer
15 years 6 months ago
2009
Springer
We develop a method for performing boolean convolutions efficiently in word RAM model of computation, having a word size of w = Ω(log n) bits, where n is the input size. The tech...
102
Voted
SODA
1998
ACM
15 years 29 days ago
1998
ACM
We give two algorithms for finding all approximate matches of a pattern in a text, where the edit distance between the pattern and the matching text substring is at most k. The fir...
SPIRE
1999
Springer
15 years 3 months ago
1999
Springer
Approximate string matching is an important paradigm in domains ranging from speech recognition to information retrieval and molecular biology. In this paper, we introduce a new f...
BIRTHDAY
2010
Springer
14 years 6 months ago
2010
Springer
Abstract. We present a method to speed up approximate string matching by mapping the factual alphabet to a smaller alphabet. We apply the alphabet reduction scheme to a tuned versi...