Closeness to the diagonal for longest common subsequences in random words (Q287834)
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: Closeness to the diagonal for longest common subsequences in random words |
scientific article; zbMATH DE number 6583869
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Closeness to the diagonal for longest common subsequences in random words |
scientific article; zbMATH DE number 6583869 |
Statements
Closeness to the diagonal for longest common subsequences in random words (English)
0 references
23 May 2016
0 references
longest common subsequences
0 references
optimal alignments
0 references
last passage percolation
0 references
edit/Levensthein distance
0 references
0.871470034122467
0 references
0.844684898853302
0 references
0.8179562091827393
0 references
0.8089974522590637
0 references
0.8039880990982056
0 references
