Approximate string matching using withinword parallelism (Q4305003): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:43, 6 February 2024
scientific article; zbMATH DE number 633625
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximate string matching using withinword parallelism |
scientific article; zbMATH DE number 633625 |
Statements
Approximate string matching using withinword parallelism (English)
0 references
2 August 2000
0 references
dynamic programming
0 references
approximate string matching
0 references
approximate string searching
0 references
edit distance
0 references
pseudo-parallelism
0 references
parallel algorithm
0 references
parallel computation
0 references
