Sciweavers

77
Voted
JDA
2008
72views more  JDA 2008»
14 years 9 months ago
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, ...
Alexander Tiskin
64
Voted
CSR
2006
Springer
15 years 1 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