CORR
2004
Springer
13 years 4 months ago
2004
Springer
: Described are two algorithms to find long approximate palindromes in a string, for example a DNA sequence. A simple algorithm requires O(n)space and almost always runs in O(k.n)-...