THE SET-SET LCS PROBLEM

[1] BLOCH JJ, 1985, 1985 P INT COMP MUS

[2] LINEAR SPACE ALGORITHM FOR COMPUTING MAXIMAL COMMON SUBSEQUENCES [J]. COMMUNICATIONS OF THE ACM, 1975, 18 (06) : 341 - 343

[3] THE SET LCS PROBLEM [J]. ALGORITHMICA, 1987, 2 (01) : 91 - 95

[4] A FASTER ALGORITHM COMPUTING STRING EDIT DISTANCES [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1980, 20 (01) : 18 - 31

[5] An O(ND) Difference Algorithm and Its Variations [J]. ALGORITHMICA, 1986, 1 (1-4) : 251 - 266

[6] Sankoff D., 1983, TIME WARPS STRING ED

[1] BLOCH JJ, 1985, 1985 P INT COMP MUS

[2] LINEAR SPACE ALGORITHM FOR COMPUTING MAXIMAL COMMON SUBSEQUENCES [J]. COMMUNICATIONS OF THE ACM, 1975, 18 (06) : 341 - 343

[3] THE SET LCS PROBLEM [J]. ALGORITHMICA, 1987, 2 (01) : 91 - 95

[4] A FASTER ALGORITHM COMPUTING STRING EDIT DISTANCES [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1980, 20 (01) : 18 - 31

[5] An O(ND) Difference Algorithm and Its Variations [J]. ALGORITHMICA, 1986, 1 (1-4) : 251 - 266

[6] Sankoff D., 1983, TIME WARPS STRING ED