A central limit theorem for the length of the longest common subsequences in random words (Q2679696): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Revision as of 08:04, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A central limit theorem for the length of the longest common subsequences in random words |
scientific article |
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
