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 worst case time-complexity is O(n2
创建时间：
2022-08-29
