Finding Approximate Palindromes in Strings Quickly and Simply

L. Allison

Finding Approximate Palindromes in Strings Quickly and Simply

数据结构与算法 2007-05-23 v1

作者: L. Allison

摘要

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.

关键词

string algorithms graph algorithm succinct data structure

引用

@article{arxiv.cs/0412004,
  title  = {Finding Approximate Palindromes in Strings Quickly and Simply},
  author = {L. Allison},
  journal= {arXiv preprint arXiv:cs/0412004},
  year   = {2007}
}

备注

4 pages, 3 figures, code of the simple algorithm will soon be placed at http://www.csse.monash.edu.au/~lloyd/tildeProgLang/Java2/Palindromes/

相关论文

查看更多相关论文 →