Bounds on the Complexity of the Longest Common Subsequence Problem

@article{Aho1976BoundsOT,
title={Bounds on the Complexity of the Longest Common Subsequence Problem},
author={Alfred V. Aho and Daniel S. Hirschberg and Jeffrey D. Ullman},
journal={J. ACM},
year={1976},
volume={23},
pages={1-12}
}

The problem of finding a longest common subsequence of two strings is discussed. This problem arises in data processing applications such as comparing two files and in genetic applications such as studying molecular evolution. The difficulty of computing a longest common subsequence of two strings is examined using the decision tree model of computation, in which vertices represent “equal - unequal” comparisons. It is shown that unless a bound on the total number of distinct symbols is assumed… CONTINUE READING