A Fast Algorithm for Computing Longest Common Subsequences

@inproceedings{Hunt2000AFA,
  title={A Fast Algorithm for Computing Longest Common Subsequences},
  author={James W. Hunt and Thomas G. Szymanski},
  year={2000}
}
References 1. Benner, F.H. On designing generalized file records for management information systems. Proc. AFIPS 1967 FJCC, Vol. 31, AFIPS Press, Montvale, N.J., pp. 291-303. 2. Burroughs DISK FORTE Users Manual. Burroughs Corp., Detroit, Mich., 1973. 3. Collmeyer, A.J., and Shemer, J.E. Analysis of retrieval performance for selected file organization techniques. Proc. AFIPS 1970 FJCC, Vol. 37, pp. 201-210. 4. Olle, T.W. Generalized systems for storing structured variable length data and… CONTINUE READING
Highly Influential
This paper has highly influenced a number of papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 401 citations. REVIEW CITATIONS

Topics

Statistics

02040'99'01'03'05'07'09'11'13'15'17
Citations per Year

401 Citations

Semantic Scholar estimates that this publication has 401 citations based on the available data.

See our FAQ for additional information.