122 search results - page 7 / 25 » Vector Algorithms for Approximate String Matching |
IPPS
2002
IEEE
14 years 25 days ago
2002
IEEE
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
SPIRE
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...
SPIRE
1999
Springer
14 years 5 days 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...
CPM
2008
Springer
13 years 9 months ago
2008
Springer
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
SPIRE
1998
Springer
14 years 3 days ago
1998
Springer
A successful technique to search large textual databases allowing errors relies on an online search in the vocabulary of the text. To reduce the time of that online search, we ind...