53 search results - page 3 / 11 » A Fast Bit-Vector Algorithm for Approximate String Matching ... |
TCBB
2010
13 years 3 months ago
2010
— We present efficient cache-oblivious algorithms for some well-studied string problems in bioinformatics including the longest common subsequence, global pairwise sequence alig...
SIGMOD
2008
ACM
14 years 5 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
SIGIR
1998
ACM
13 years 9 months ago
1998
ACM
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
ICIP
2006
IEEE
14 years 6 months ago
2006
IEEE
This paper presents a novel method for efficient boundary based shapes matching and retrieval in presence of occlusion. In this method, the geometric and topological information o...