Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings

An Efficient Systolic Algorithm for the Longest CommonSubsequence Problem

The Journal of Supercomputing

Speeding-up Hirschberg and Hunt-Szymanski LCS algorithms

Fundamenta Informaticae - Special issue on computing patterns in strings

An almost-linear time and linear space algorithm for the longest common subsequence problem

Information Processing Letters

Note: Computing the longest topological common subsequence of a symbol-wise totally ordered directed acyclic graph and a sequence

Theoretical Computer Science

An almost-linear time and linear space algorithm for the longest common subsequence problem

Information Processing Letters

Fast computation of a longest increasing subsequence and application

Information and Computation

Variants of constrained longest common subsequence

Information Processing Letters

Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms

Fundamenta Informaticae - Computing Patterns in Strings