JDA
2008
13 years 11 months ago
2008
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, ...
CPM
2006
Springer
14 years 2 months ago
2006
Springer
For two strings a, b, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In a previous paper, we defined a generalisat...