Approximate string matching using withinword parallelism (Q4305003): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/spe.4380240402 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2075760092 / rank | |||
Normal rank | |||
Latest revision as of 01:56, 20 March 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
