A new flexible algorithm for the longest common subsequence problem

Claus Rick
Proc. 6th Symp. Combinatorial Pattern Matching (CPM 1995), Lecture Notes in Computer Science 937, Zvi Galil and Esko Ukkonen, ed., Springer-Verlag, Jul 1995
Nordic J. Computing 2(4):444–461, 1995
http://web.informatik.uni-bonn.de/IV/Mitarbeiter/rick/lcs.dvi.Z

Cites:

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine
Made on a Mac Valid XHTML 1.0!