13 search results - page 1 / 3 » A Parallel Algorithm for Fixed-Length Approximate String-Mat... |
83
Voted
BIRTHDAY
2010
Springer
15 years 2 months ago
2010
Springer
140
Voted
CPM
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
121
Voted
ALGORITHMICA
2005
15 years 29 days ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
100
Voted
ISPAN
1997
IEEE
15 years 5 months ago
1997
IEEE
Abstract- String matching problem received much attention over the years due to its importance in various applications such as text/file comparison, DNA sequencing, search engines,...
142
Voted
WEA
2004
Springer
15 years 6 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...