Date of Original Version

10-2014

Type

Article

Rights Management

© 2014, Society for Industrial and Applied Mathematics

Abstract or Description

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 + cn1−1/(t−k−2) for some c > 0 depending on k and t. This is sharp up to the value of c.

DOI

10.1137/140975000

Creative Commons


This work is licensed under a Creative Commons Attribution-Noncommercial-Share Alike 4.0 License.

Included in

Mathematics Commons

Share

COinS
 

Published In

SIAM Journal on Discrete Mathematics, 28, 4, 2042-2049.