A fast bit-vector algorithm for approximate string matching based on dynamic programming (Q3158541): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: DBLP publication ID (P1635): journals/jacm/Myers99, #quickstatements; #temporary_batch_1731475607626 |
||
| (4 intermediate revisions by 4 users not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q29030245 / rank | |||
Normal rank | |||
| 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.1145/316542.316550 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2100751585 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/jacm/Myers99 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 07:10, 13 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast bit-vector algorithm for approximate string matching based on dynamic programming |
scientific article |
Statements
A fast bit-vector algorithm for approximate string matching based on dynamic programming (English)
0 references
25 January 2005
0 references
