Bounding the expected length of longest common subsequences and forests (Q1293550)

From MaRDI portal
Revision as of 03:56, 18 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Bounding the expected length of longest common subsequences and forests
scientific article

    Statements

    Bounding the expected length of longest common subsequences and forests (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 June 1999
    0 references
    0 references
    two random sequences
    0 references
    Markov chains
    0 references