Sciweavers

CSR
2006
Springer
14 years 4 months ago
All Semi-local Longest Common Subsequences in Subquadratic Time
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, w...
Alexandre Tiskin