Sciweavers

45 search results - page 2 / 9
» Compressed Indexes for Approximate String Matching
Sort
View
DASFAA
2009
IEEE
136views Database» more  DASFAA 2009»
14 years 1 months ago
A Two-Tire Index Structure for Approximate String Matching with Block Moves
Many applications need to solve the problem of approximate string matching with block moves. It is an NP-Complete problem to compute block edit distance between two strings. Our go...
Bin Wang, Long Xie, Guoren Wang
SIGMOD
2009
ACM
129views Database» more  SIGMOD 2009»
14 years 7 months ago
Incremental maintenance of length normalized indexes for approximate string matching
Marios Hadjieleftheriou, Nick Koudas, Divesh Sriva...
CPM
1999
Springer
127views Combinatorics» more  CPM 1999»
13 years 11 months ago
A New Indexing Method for Approximate String Matching
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...
Gonzalo Navarro, Ricardo A. Baeza-Yates
CPM
2007
Springer
124views Combinatorics» more  CPM 2007»
14 years 1 months ago
Cache-Oblivious Index for Approximate String Matching
Wing-Kai Hon, Tak Wah Lam, Rahul Shah, Siu-Lung Ta...