Look here you will find what is required to deal with palindromes.
Here’s a blog that refers the suffix tree and palindrome, and I quote:
“Interestingly, the algorithms for finding palindromes developed by computational biologists generally use suffix trees, and both space and time consumption seem to be worse compared with the algorithm I give in this blog message.”
http://johanjeuring.blogspot.com/2007/08/finding-palindromes.html
and also
http://www.akalin.cx/2007/11/28/finding-the-longest-palindromic-substring-in-linear-time/
Suffix tree to search the longest duplicated substring
http://www.ddj.com/architect/184404588
No comments:
Post a Comment