Algorithms for the Longest Common Subsequence Problem.

Daniel S. Hirschberg: Algorithms for the Longest Common Subsequence Problem. J. ACM 24(4): 664-675(1977)

@article{DBLP:journals/jacm/Hirschberg77,
  author    = {Daniel S. Hirschberg},
  title     = {Algorithms for the Longest Common Subsequence Problem},
  journal   = {J. ACM},
  volume    = {24},
  number    = {4},
  year      = {1977},
  pages     = {664-675},
  ee        = {db/journals/jacm/Hirschberg77.html, http://doi.acm.org/10.1145/322033.322044},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

BibTeX

Online Edition

Citation Page BibTeX

Referenced by

M. W. Du, S. C. Chang: An Approach to Designing Very Fast Approximate String Matching Algorithms. IEEE Trans. Knowl. Data Eng. 6(4): 620-633(1994)

BibTeX