318 search results - page 6 / 64 » A New Indexing Method for Approximate String Matching |
ICPR
2008
IEEE
14 years 1 months ago
2008
IEEE
The Boyer-Moore algorithm uses two pre-computed tables for searching a string: skip, which utilizes the occurrence heuristic of symbols in a pattern, and shift, which utilizes the...
IFIPTCS
2000
13 years 10 months ago
2000
We present an index to search a two-dimensional pattern of size m m in a two-dimensional text of size n n, even when the pattern appears rotated in the text. The index is based on ...
SPIRE
2005
Springer
14 years 14 days ago
2005
Springer
Let A and B be strings with lengths m and n, respectively, over a finite integer alphabet. Two classic string mathing problems are computing the edit distance between A and B, and...
DASFAA
2003
IEEE
14 years 9 days ago
2003
IEEE
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
VLDB
2003
ACM
14 years 7 months ago
2003
ACM
Due to their expressive power, Regular Expressions (REs) are quickly becoming an integral part of language specifications for several important application scenarios. Many of thes...