Bounds on the Complexity of the Longest Common Subsequence Problem (Extended Abstract)

Alfred V. Aho, Daniel S. Hirschberg, Jeffrey D. Ullman. Bounds on the Complexity of the Longest Common Subsequence Problem (Extended Abstract). In 15th Annual Symposium on Switching and Automata Theory, 14-16 October 1974, The University of New Orleans, USA. pages 104-109, IEEE, 1974.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.