A lower bound for the edit-distance problem under an arbitrary cost function (Q1107330)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:1107330 |
scientific article; zbMATH DE number 4064521
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower bound for the edit-distance problem under an arbitrary cost function |
scientific article; zbMATH DE number 4064521 |
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
0.8402078747749329
0 references
0.8197701573371887
0 references
0.8125612139701843
0 references
