On the longest common increasing binary subsequence

被引：15

作者：

Houdre, Christian ^{[1
]}

Lember, Juri

Matzinger, Heinrich

机构：

[1] Georgia Inst Technol, Sch Math, Atlanta, GA 30332 USA

[2] Univ Tartu, Inst Math Sci, EE-50409 Tartu, Estonia

来源：

COMPTES RENDUS MATHEMATIQUE | 2006年 / 343卷 / 09期

关键词：

D O I：

10.1016/j.crma.2006.10.004

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let X-1, X-2,... and Y-1, Y-2,... be two independent sequences of iid Bernoulli random variables with parameter 1/2. Let LCIn be the length of the longest increasing sequence which is a subsequence of both finite sequences X-1,..., X-n and Y-1,..., Y-n. We prove that, as n goes to infinity, n(-1/2)(LCIn - n/2) converges in law to a Brownian functional that we identify.

引用

页码：589 / 594

页数：6

共 50 条

[21] The Longest Almost-Increasing Subsequence
Elmasry, Amr
[J]. COMPUTING AND COMBINATORICS, 2010, 6196 : 338 - 347
[22] The longest almost-increasing subsequence
Elmasry, Amr
[J]. INFORMATION PROCESSING LETTERS, 2010, 110 (16) : 655 - 658
[23] On the longest increasing subsequence of a circular list
Albert, M. H.
Atkinson, M. D.
Nussbaum, Doron
Sack, Jorg-Rudiger
Santoro, Nicola
[J]. INFORMATION PROCESSING LETTERS, 2007, 101 (02) : 55 - 59
[24] A linear algorithm for 3-letter longest common weakly increasing subsequence
Duraj, Lech
[J]. INFORMATION PROCESSING LETTERS, 2013, 113 (03) : 94 - 99
[25] Computing a longest common subsequence that is almost increasing on sequences having no repeated elements
Moosa, Johra Muhammad
Rahman, M. Sohel
Zohora, Fatema Tuz
[J]. JOURNAL OF DISCRETE ALGORITHMS, 2013, 20 : 12 - 20
[26] ALGORITHMS FOR LONGEST COMMON SUBSEQUENCE PROBLEM
HIRSCHBERG, DS
[J]. JOURNAL OF THE ACM, 1977, 24 (04) : 664 - 675
[27] Quantum algorithm for longest common subsequence
Xu, Wen-Xu
Liao, Ming-Hong
[J]. Tien Tzu Hsueh Pao/Acta Electronica Sinica, 2007, 36 (SUPPL. 2): : 99 - 103
[28] THE LONGEST COMMON SUBSEQUENCE PROBLEM REVISITED
APOSTOLICO, A
GUERRA, C
[J]. ALGORITHMICA, 1987, 2 (03) : 315 - 336
[29] On the constrained longest common subsequence problem
[J]. Gorbenko, A. (gorbenko.aa@gmail.com), 1600, International Association of Engineers (40):
[30] On finding a longest common palindromic subsequence
Bae, Sang Won
Lee, Inbok
[J]. THEORETICAL COMPUTER SCIENCE, 2018, 710 : 29 - 34

← 1 2 3 4 5 →