An Information Theoretic Lower Bound for the Longest Common Subsequence Problem

Hirschberg, D.S.2007-10-312007-10-311977-04-202003-10-22D. Hirschberg, "An Information Theoretic Lower Bound for the Longest Common Subsequence Problem," <i>Rice University ECE Technical Report,</i> no. 7705, 1977.https://hdl.handle.net/1911/19954Tech ReportWe shall derive a lower on the number of "less-than-equal-greater than" comparisons required to solve the longest common subsequence (LCS) problem.engsequenceAn Information Theoretic Lower Bound for the Longest Common Subsequence ProblemReportsequence