A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
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 worst case time-complexity is O(n2doi:10.26180/20707258 fatcat:okli6ee5gnciti6cytmosyueti