Improved bounds on the average length of longest common subsequences

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 130-131

  Lueker, George S ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY VALUE PROBLEMS; DYNAMIC PROGRAMMING; FINITE AUTOMATA; MARKOV PROCESSES; PROBLEM SOLVING;

LONGEST COMMON SUBSEQUENCE; LOWER BOUND; UPPER BOUND;

SEQUENTIAL MACHINES;

EID: 0038416655     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. K. S. Alexander. The rate of convergence of the mean length of the longest common subsequence. Annals of Applied Probability, 4(4):1074-1082, 1994.
2. R. A. Baeza-Yates, R. Gavaldà, G. Navarro, and R. Scheihing. Bounding the expected length of longest common subsequences and forests. Theory Comput. Systems, 32:435-452, 1999.
3. V. Chvátal and D. Sankoff. Longest common subsequences of two random sequences. Journal of Applied Probability, 12:306-315, 1975.
4. V. Dančík. Expected Length of Longest Common Subsequences. PhD thesis, Department of Computer Science, University of Warwick, Sept. 1994.
5. V. Dančík and M. Paterson. Upper bounds for the expected length of a longest common subsequence of two binary sequences. Random Structures & Algorithms, pages 449-458, 1995.
6. J. M. Steele. Probability Theory and Combinatorial Optimization. CMBS-NSF Regional Conference Series in Applied Mathematics. Society for Industrial and Applied Mathematics, 1997.