On the longest common increasing binary subsequence (Q857117): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.crma.2006.10.004 / rank
Normal rank
 
Property / author
 
Property / author: Heinrich III Matzinger / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Nicko G. Gamkrelidze / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.crma.2006.10.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1981481562 / 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: GUEs and queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest increasing subsequences of random colored permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2759649 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random words, Toeplitz determinants and integrable systems. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete orthogonal polynomial ensembles and the Plancherel measure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distributions of the lengths of the longest monotone subsequences in random words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4315008 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.CRMA.2006.10.004 / rank
 
Normal rank

Latest revision as of 05:36, 10 December 2024

scientific article
Language Label Description Also known as
English
On the longest common increasing binary subsequence
scientific article

    Statements

    On the longest common increasing binary subsequence (English)
    0 references
    0 references
    0 references
    0 references
    14 December 2006
    0 references
    This paper deals with the problem of the longest common and increasing subsequence of two random binary sequences. Let \(X_1,X_2,\dots\) and \(Y_1,Y_2\dots\) be two independent sequences of iid Bernoulli random variables with parameter 1/2. Let LCI\(_n\) be the length of the longest increasing sequence which is a subsequence of both finite sequences \(X_1,\dots,X_n\) and \(Y_1,\dots,Y_n\). The authors prove that, as \(n\) goes to infinity, \(n^{-1/2}(\text{LCI}_n-n/2)\) converges in law to a Brownian functional that they identify.
    0 references
    Binary sequence
    0 references
    Brownian functional
    0 references

    Identifiers