Bounding the Expected Length of Longest Common Subsequences and Forests

被引：0

作者：

R. A. Baeza-Yates

R. Gavaldà

G. Navarro

R. Scheihing

机构：

[1] Department of Computer Science,

[2] University of Chile,undefined

[3] Blanco Encalada 2120,undefined

[4] Santiago,undefined

[5] Chile rbaeza@dcc.uchile.cl,undefined

[6] gnavarro@dcc.uchile.cl,undefined

[7] rscheihi@dcc.uchile.cl ,undefined

[8] Department of LSI,undefined

[9] Technical University of Catalunya,undefined

[10] Jordi Girona Salgado 1—3,undefined

[11] 08034 Barcelona,undefined

[12] Spain gavalda@lsi.upc.es,undefined

来源：

Theory of Computing Systems | 1999年 / 32卷

关键词：

Markov Chain; Random Sequence; Exact Result; Short Sequence; Fixed Size;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

We present improvements to two techniques to find lower and upper bounds for the expected length of longest common subsequences and forests of two random sequences of the same length, over a fixed size, uniformly distributed alphabet. We emphasize the power of the methods used, which are Markov chains and Kolmogorov complexity. As a corollary, we obtain some new lower and upper bounds for the problems addressed as well as some new exact results for short sequences.

引用

页码：435 / 452

页数：17

共 50 条

[1] Bounding the expected length of longest common subsequences and forests
BaezaYates, RA
Gavaldà, R
Navarro, G
Scheihing, R
THEORY OF COMPUTING SYSTEMS, 1999, 32 (04) : 435 - 452
[2] Bounding the expected length of longest common subsequences and forests
Department of Computer Science, University of Chile, Blanco Encalada 2120, Santiago, Chile
不详
Theory Comput. Syst., 4 (435-452):
[3] Common subsequences and supersequences and their expected length
Dancík, V
COMBINATORICS PROBABILITY & COMPUTING, 1998, 7 (04): : 365 - 373
[4] Common subsequences and supersequences and their expected length
Dancik, V
COMBINATORIAL PATTERN MATCHING, 1995, 937 : 55 - 63
[5] Large deviations-based upper bounds on the expected relative length of longest common subsequences
Hauser, Raphael
Martinez, Servet
Matzinger, Heinrich
ADVANCES IN APPLIED PROBABILITY, 2006, 38 (03) : 827 - 852
[6] Improved bounds on the average length of longest common subsequences
Lueker, GS
PROCEEDINGS OF THE FOURTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2003, : 130 - 131
[7] Improved Bounds on the Average Length of Longest Common Subsequences
Lueker, George S.
JOURNAL OF THE ACM, 2009, 56 (03)
[8] A Note on the Expected Length of the Longest Common Subsequences of two i.i.d. Random Permutations
Houdre, Christian
Xu, Chen
ELECTRONIC JOURNAL OF COMBINATORICS, 2018, 25 (02):
[9] Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences
Bannai, Hideo
Tomohiro, I
Kociumaka, Tomasz
Koeppl, Dominik
Puglisi, Simon J.
ALGORITHMICA, 2024, 86 (03) : 735 - 756
[10] Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences
Hideo Bannai
Tomohiro I.
Tomasz Kociumaka
Dominik Köppl
Simon J. Puglisi
Algorithmica, 2024, 86 : 735 - 756

← 1 2 3 4 5 →