LONGEST COMMON SUBSEQUENCES IN SETS OF WORDS

被引：14
|
作者：
Bukh, Boris [1 ]
Ma, Jie [2 ]
机构：
[1] Carnegie Mellon Univ, Dept Math Sci, Pittsburgh, PA 15213 USA
[2] Univ Sci & Technol China, Sch Math Sci, Hefei 230026, Anhui, Peoples R China
来源：
SIAM JOURNAL ON DISCRETE MATHEMATICS | 2014年 / 28卷 / 04期
基金：
美国国家科学基金会;
关键词：
balanced word; common subsequence; LCS;
D O I：
10.1137/140975000
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Given a set of t >= k + 2 words of length n over a k-letter alphabet, it is proved that there exists a common subsequence among two of them of length at least n/k + cn(1-1/(t-k-2)) for some c > 0 depending on k and t. This is sharp up to the value of c.
引用
收藏
页码：2042 / 2049
页数：8
相关论文
共 50 条
  • [1] Closeness to the diagonal for longest common subsequences in random words
    Houdre, Christian
    Matzinger, Heinrich
    ELECTRONIC COMMUNICATIONS IN PROBABILITY, 2016, 21
  • [2] 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
  • [3] 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
  • [4] On the limiting law of the length of the longest common and increasing subsequences in random words
    Breton, Jean-Christophe
    Houdre, Christian
    STOCHASTIC PROCESSES AND THEIR APPLICATIONS, 2017, 127 (05) : 1676 - 1720
  • [5] A central limit theorem for the length of the longest common subsequences in random words
    Houdre, Christian
    Islak, Umit
    ELECTRONIC JOURNAL OF PROBABILITY, 2023, 28
  • [6] On the Order of the Central Moments of the Length of the Longest Common Subsequences in Random Words
    Houdre, Christian
    Ma, Jinyong
    HIGH DIMENSIONAL PROBABILITY VII: THE CARGESE VOLUME, 2016, 71 : 105 - 136
  • [7] Computing Longest (Common) Lyndon Subsequences
    Bannai, Hideo
    Tomohiro, I
    Kociumaka, Tomasz
    Koppl, Dominik
    Puglisi, Simon J.
    COMBINATORIAL ALGORITHMS (IWOCA 2022), 2022, 13270 : 128 - 142
  • [8] On the limiting law of the length of the longest common and increasing subsequences in random words with arbitrary distribution
    Deslandes, Clement
    Houdre, Christian
    ELECTRONIC JOURNAL OF PROBABILITY, 2021, 26
  • [9] ON THE APPROXIMATION OF SHORTEST COMMON SUPERSEQUENCES AND LONGEST COMMON SUBSEQUENCES
    JIANG, T
    LI, M
    SIAM JOURNAL ON COMPUTING, 1995, 24 (05) : 1122 - 1139
  • [10] On the distributions of the lengths of the longest monotone subsequences in random words
    Craig A. Tracy
    Harold Widom
    Probability Theory and Related Fields, 2001, 119 : 350 - 380
12345