Name
Abstract | ||
|---|---|---|
This paper shows how the basic dynamic programming problem for the approximate string matchingproblem can be "parallelized" by using "pieces" of computer words. This technique is most useful whenthe alphabet is small and when the word size of the processor is large. For example, when the word sizeis 64 bits and the alphabet size is 8 (using three bits per character), the degree of parallelism is 21.Empirical results indicate an approximate speedup of 4.6 over the basic dynamic programming... |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1002/spe.4380240402 | Softw., Pract. Exper. |
Keywords | DocType | Volume |
within-word parallelism,approximate string,approximate string matching approximate string searching edit distance within-wor d parallelism parallel algorithm parallel compu tation. | Journal | 24 |
Issue | ISSN | Citations |
4 | 0038-0644 | 16 |
PageRank | References | Authors |
2.31 | 9 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alden H. Wright | 1 | 330 | 45.58 |