快速简单地在字符串中查找近似回文
Finding Approximate Palindromes in Strings Quickly and Simply
摘要：
描述了两种算法，以找到长的近似回文在一个字符串，例如DNA序列。一个简单的算法需要O（n）空间，并且几乎总是在$O(k.n)$时间内运行，其中n是字符串的长度，k是回文中允许的“错误”的数量。它的最坏情况的时间复杂度是$O(n^2)$，但这不会发生在真实的生物序列。更复杂的算法保证了$O(k.n)$的最差时间复杂度。
英文摘要：
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(n^2)$ but this does not occur with real biological sequences. A more complex algorithm guarantees $O(k.n)$ worst-case time complexity.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
