O(n) algorithm to find longest palindromic substring w/o suffix trees

Does anyone know why the suffix tree algorithm is the one commonly shown as the solution to finding the longest palindrome? Manacher's algorithm is conceptually simpler, has better performance and memory demands, and isn't new (the original paper is from 1975).

Does finding substring palindromes have any practical purpose at all? Just curious.

Such a long explanation for what could be explained in a couple lines of code.

Clojure vs. Common Lisp <a href="http://news.ycombinator.com/item?id=1016566" rel="nofollow">http://news.ycombinator.com/item?id=1016566</a>

I'm honestly just curious and I could be missing something trivial... but how does the "simple asymptotically optimal solution" take into account an even length palindrome? in the sense of "deed" where there are never matching letters to the left and right of the interesting position...i think it would still be O(n) but I just don't see the algorithm taking it into account...

site is down? I hope this isn't just an O(N) algorithm using Suffix Arrays