Expected length of the longest common subsequence for large alphabets (Q2573406): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Marcos A. Kiwi / rank
Normal rank
 
Property / author
 
Property / author: Martin Loebl / rank
Normal rank
 
Property / author
 
Property / author: Ji{ří} Matoušek / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q56171970 / rank
 
Normal rank
Property / author
 
Property / author: Marcos A. Kiwi / rank
 
Normal rank
Property / author
 
Property / author: Martin Loebl / rank
 
Normal rank
Property / author
 
Property / author: Ji{ří} Matoušek / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2002883296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the expected length of longest common subsequences and forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distribution of the length of the longest increasing subsequence of random permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest common subsequences of two random sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5759552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the length of the longest monotone subsequence in a random permutation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limit theorems for height fluctuations in a class of discrete space and time growth models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5645369 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subadditive ergodic theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Largest planar matching in random bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variational problem for random Young tableaux / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471286 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4523136 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest Increasing and Decreasing Subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Increasing sequences of independent points on the planar lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent progress in algebraic combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efron-Stein inequality for nonsymmetric statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4192066 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:12, 11 June 2024

scientific article
Language Label Description Also known as
English
Expected length of the longest common subsequence for large alphabets
scientific article

    Statements

    Expected length of the longest common subsequence for large alphabets (English)
    0 references
    22 November 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    Longest common subsequence
    0 references
    Longest increasing subsequence
    0 references
    Expectation
    0 references
    Sankoff-Mainville conjecture
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references