The Noisy Substring Matching Problem (Q4747554): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Rangasami L. Kashyap / rank | |||
| Property / author | |||
| Property / author: Rangasami L. Kashyap / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q60328416 / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 18:13, 5 March 2024
scientific article; zbMATH DE number 3804908
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Noisy Substring Matching Problem |
scientific article; zbMATH DE number 3804908 |
Statements
The Noisy Substring Matching Problem (English)
0 references
1983
0 references
error correction in strings
0 references
Levenshtein metric
0 references
string set estimation
0 references
text editing
0 references
