Sciweavers

122 search results - page 4 / 25
» Vector Algorithms for Approximate String Matching
Sort
View
CORR
2008
Springer
69views Education» more  CORR 2008»
13 years 8 months ago
Improved Algorithms for Approximate String Matching (Extended Abstract)
Dimitrios P. Papamichail, Georgios P. Papamichail
WADS
1997
Springer
94views Algorithms» more  WADS 1997»
14 years 6 hour ago
Multiple Approximate String Matching
Ricardo A. Baeza-Yates, Gonzalo Navarro
CPM
1993
Springer
125views Combinatorics» more  CPM 1993»
13 years 12 months ago
Detecting False Matches in String Matching Algorithms
Consider a text string of length n, a pattern string of length m, and a match vector of length n which declares each location in the text to be either a mismatch (the pattern does ...
S. Muthukrishnan
ISPAN
1997
IEEE
14 years 2 days ago
RMESH Algorithms for Parallel String Matching
Abstract- String matching problem received much attention over the years due to its importance in various applications such as text/file comparison, DNA sequencing, search engines,...
Hsi-Chieh Lee, Fikret Erçal
IWOCA
2009
Springer
132views Algorithms» more  IWOCA 2009»
14 years 2 months ago
Fast Convolutions and Their Applications in Approximate String Matching
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...
Kimmo Fredriksson, Szymon Grabowski