External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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.

Abstract

Abstract is missing.

runs on