108 search results - page 7 / 22 » Families of FPGA-Based Algorithms for Approximate String Mat... |
188
click to vote
WEA
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for t...
156
click to vote
IPPS
2002
IEEE
15 years 10 months 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....
144
click to vote
SPIRE
2007
Springer
15 years 12 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...
147
click to vote
SPIRE
1999
Springer
15 years 10 months 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...
162
click to vote
NIPS
2008
15 years 7 months ago
2008
We present a new family of linear time algorithms based on sufficient statistics for string comparison with mismatches under the string kernels framework. Our algorithms improve t...