Sciweavers

CPM
2009
Springer
121views Combinatorics» more  CPM 2009»
13 years 11 months ago
LCS Approximation via Embedding into Local Non-repetitive Strings
A classical measure of similarity between strings is the length of the longest common subsequence(LCS) between the two given strings. The search for efficient algorithms for findi...
Gad M. Landau, Avivit Levy, Ilan Newman