Re:O(n) algorithm to find longest palindromic substring w/o ...
by bbi5291 on Monday April 09, 2012 @12:55AM
(#3815881)
I think the answer to this is that the suffix tree algorithm is conceptually simpler if you already know suffix trees. Personally, I find Manacher's algorithm very difficult to intuit (and I'm the one who wrote the article in this post in the first place). Its better performance is indisputable, though.
[ Parent
| on HN ]
Re:O(n) algorithm to find longest palindromic substring w/o ...
by dhruvbird on Monday April 09, 2012 @01:28PM
(#3818051)
I should thank you for the brilliantly written article. All the claims have been mentioned clearly, and the reasoning strung together in a coherent manner.
I agree with the fact that getting the optimization isn't intuitive, but the basic O(n^2) on which the idea is based is almost trivial.