Bounds on the Complexity of the Longest Common Subsequence Problem.

Alfred V. Aho, Daniel S. Hirschberg, Jeffrey D. Ullman: Bounds on the Complexity of the Longest Common Subsequence Problem. J. ACM 23(1): 1-12(1976)

@article{DBLP:journals/jacm/AhoHU76,
  author    = {Alfred V. Aho and
               Daniel S. Hirschberg and
               Jeffrey D. Ullman},
  title     = {Bounds on the Complexity of the Longest Common Subsequence Problem},
  journal   = {J. ACM},
  volume    = {23},
  number    = {1},
  year      = {1976},
  pages     = {1-12},
  ee        = {db/journals/jacm/AhoHU76.html, http://doi.acm.org/10.1145/321921.321922},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

BibTeX

Online Edition

Citation Page BibTeX

Referenced by

Sudarshan S. Chawathe: Comparing Hierarchical Data in External Memory. VLDB 1999: 90-101

BibTeX