On the longest common increasing binary subsequence (Q857117): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
Property / DOI | |||
Property / DOI: 10.1016/j.crma.2006.10.004 / 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
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
0 references
0 references