String Editing and Longest Common Subsequences

This publication has 38 references indexed in Scilit:

• A faster parallel algorithm for a matrix searching problem
  Algorithmica, 1993
• Fast linear-space computations of longest common subsequences
  Theoretical Computer Science, 1992
• Parallel Algorithmic Techniques For Combinational Computation
  Annual Review of Computer Science, 1988
• The longest common subsequence problem revisited
  Algorithmica, 1987
• Remark on the HSUDU new algorithm for the longest common subsequence problem
  Information Processing Letters, 1987
• Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings
  Information Processing Letters, 1986
• An almost optimal algorithm for unbounded searching
  Information Processing Letters, 1976
• Optimal Code Generation for Expression Trees
  Journal of the ACM, 1976
• On computing the length of longest increasing subsequences
  Discrete Mathematics, 1975
• A Decomposition Theorem for Partially Ordered Sets
  Annals of Mathematics, 1950