An Information Theoretic Lower Bound for the Longest Common Subsequence Problem
Date
1977-04-20
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
We shall derive a lower on the number of "less-than-equal-greater than" comparisons required to solve the longest common subsequence (LCS) problem.
Description
Tech Report
Advisor
Degree
Type
Report
Keywords
sequence
Citation
D. Hirschberg, "An Information Theoretic Lower Bound for the Longest Common Subsequence Problem," Rice University ECE Technical Report, no. 7705, 1977.