Sciweavers

Share
CORR
2004
Springer

Finding Approximate Palindromes in Strings Quickly and Simply

11 years 9 months ago
Finding Approximate Palindromes in Strings Quickly and Simply
: 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)-time where n is the length of the string and k is the number of "errors" allowed in the palindrome. Its worstcase time-complexity is O(n2) but this does not occur with real biological sequences. A more complex algorithm guarantees O(k.n) worst-case time complexity. Code of the simple algorithm will be placed at http://www.csse.monash.edu.au/ lloyd/tildeProgLang/Java2/Palindromes/
L. Allison
Added 17 Dec 2010
Updated 17 Dec 2010
Type Journal
Year 2004
Where CORR
Authors L. Allison
Comments (0)
books