论文信息 - Finding Approximate Palindromes in Strings Quickly and Simply

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(n 2 ) but this does not oc- cur with real biological sequences. A more complex algorithm guarantees O(k.n) worst-case time com- plexity.

L. Allison

[1] Steve Rozen,et al. Abundant gene conversion between arms of palindromes in human and ape Y chromosomes , 2003, Nature.

[2] Valmir Carneiro Barbosa,et al. Finding approximate palindromes in strings , 2002, Pattern Recognit..

[3] Jonathan E. Allen,et al. Genome sequence of the human malaria parasite Plasmodium falciparum , 2002, Nature.

[4] Edward M. McCreight,et al. A Space-Economical Suffix Tree Construction Algorithm , 1976, JACM.

[5] Peter Weiner,et al. Linear Pattern Matching Algorithms , 1973, SWAT.

[6] Patrick A. V. Hall,et al. Approximate String Matching , 1994, Encyclopedia of Algorithms.

[7] Xerox Polo,et al. A Space-Economical Suffix Tree Construction Algorithm , 1976 .

[8] Michael A. Bender,et al. The LCA Problem Revisited , 2000, LATIN.

[9] Tatsuhiko Tsunoda,et al. Time and Memory Efficient Algorithm for Extracting Palindromic and Repetitive Subsequences in Nucleic Acid Sequences , 1998, Pacific Symposium on Biocomputing.