A new flexible algorithm for the longest common subsequence problem (1995)

by C Rick
Venue:in Proc. 6th Combinatorial Pattern Matching (CPM’95