A central limit theorem for the length of the longest common subsequences in random words (Q2679696)

From MaRDI portal
Revision as of 08:46, 9 January 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q122202419, #quickstatements; #temporary_batch_1704785786528)
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
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references