A lower bound for the edit-distance problem under an arbitrary cost function (Q1107330)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound for the edit-distance problem under an arbitrary cost function |
scientific article |
Statements
A lower bound for the edit-distance problem under an arbitrary cost function (English)
0 references
1988
0 references
lower bound
0 references
edit distance
0 references
RAM model of computation
0 references
longest common subsequences
0 references
0 references
