Bounding the expected length of longest common subsequences and forests (Q1293550): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 10:48, 31 January 2024

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
    28 June 1999
    0 references
    two random sequences
    0 references
    Markov chains
    0 references

    Identifiers