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 条

[1] The longest common increasing subsequence problem
Bai, YS
Weems, BP
[J]. Proceedings of the 8th Joint Conference on Information Sciences, Vols 1-3, 2005, : 362 - 366
[2] Efficient algorithms for finding a longest common increasing subsequence
Chan, WT
Zhang, Y
Fung, SPY
Ye, DS
Zhu, H
[J]. ALGORITHMS AND COMPUTATION, 2005, 3827 : 665 - 674
[3] A fast algorithm for computing a longest common increasing subsequence
Yang, IH
Huang, CP
Chao, KM
[J]. INFORMATION PROCESSING LETTERS, 2005, 93 (05) : 249 - 253
[4] Efficient algorithms for finding a longest common increasing subsequence
Wun-Tat Chan
Yong Zhang
Stanley P. Y. Fung
Deshi Ye
Hong Zhu
[J]. Journal of Combinatorial Optimization, 2007, 13 : 277 - 288
[5] Computing the longest common almost-increasing subsequence
Bhuiyan, Mohammad Tawhidul Hasan
Alam, Muhammad Rashed
Rahman, M. Sohel
[J]. THEORETICAL COMPUTER SCIENCE, 2022, 930 : 157 - 178
[6] Efficient algorithms for finding a longest common increasing subsequence
Chan, Wun-Tat
Zhang, Yong
Fung, Stanley P. Y.
Ye, Deshi
Zhu, Hong
[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2007, 13 (03) : 277 - 288
[7] A linear space algorithm for computing a longest common increasing subsequence
Sakai, Yoshifumi
[J]. INFORMATION PROCESSING LETTERS, 2006, 99 (05) : 203 - 207
[8] Tight Conditional Lower Bounds for Longest Common Increasing Subsequence
Lech Duraj
Marvin Künnemann
Adam Polak
[J]. Algorithmica, 2019, 81 : 3968 - 3992
[9] Tight Conditional Lower Bounds for Longest Common Increasing Subsequence
Duraj, Lech
Kuennemann, Marvin
Polak, Adam
[J]. ALGORITHMICA, 2019, 81 (10) : 3968 - 3992
[10] The Longest Wave Subsequence Problem: Generalizations of the Longest Increasing Subsequence Problem
Chen, Guan-Zhi
Yang, Chang-Biau
Chang, Yu-Cheng
[J]. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2024,

← 1 2 3 4 5 →