A central limit theorem for the length of the longest common subsequences in random words (Q2679696)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7644433
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A central limit theorem for the length of the longest common subsequences in random words |
scientific article; zbMATH DE number 7644433 |
Statements
A central limit theorem for the length of the longest common subsequences in random words (English)
0 references
23 January 2023
0 references
central limit theorem
0 references
edit/Levenshtein distance
0 references
last passage percolation
0 references
longest common subsequences
0 references
optimal alignments
0 references
random permutations
0 references
random words
0 references
Stein's method
0 references
supersequences
0 references
Tracy-Widom distribution
0 references
Ulam's problem
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8866354823112488
0 references
0.8812689185142517
0 references
0.855640709400177
0 references
0.8120388388633728
0 references
