An algorithm with linear expected running time for string editing with substitutions and substring reversals (Q963370)
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: An algorithm with linear expected running time for string editing with substitutions and substring reversals |
scientific article; zbMATH DE number 5694935
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm with linear expected running time for string editing with substitutions and substring reversals |
scientific article; zbMATH DE number 5694935 |
Statements
An algorithm with linear expected running time for string editing with substitutions and substring reversals (English)
0 references
19 April 2010
0 references
algorithms
0 references
edit distance
0 references
substring reversal
0 references
dynamic programming
0 references
expected running time
0 references
0.804847240447998
0 references
0.8006091713905334
0 references
