Palindromes implements an efficient, linear-time program for determining palindrome substrings in a string. It can be used to find the longest palindrome substring, or the longest palindrome around each position in a string. Furthermore, it can be used to find the longest palindrome text, that is, a substring in which spaces, punctuation symbols, and character case are ignored.

This site serves solely as an issue tracker. For more information about Palindromes, visit one of the links to the right.