Palindromes

This page provides information about software for finding palindromes in files.

 

 

 

 

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.

For example, calling palindromes -t on a file containing the string "A man, a plan, a canal, Panama!" will return that string itself: "A man, a plan, a canal, Panama!".


Download

You can download palindromes from hackage.


Background


Information about Palindromes


Bugs and Support

  • For general concerns and questions, contact johan at jeuring.net