A palindrome is a string of the form S=A1A2 or S=A1aA2, where A1 and A2 are substrings of S and the reverse of A2 exactly matches with A1. Palindromes have some important biological consequences, especially in sequence analysis. For example, DNA palindromes show direct influence on tumerogenesis due to the consistence formation of DNA palindromes at miRNA genes, which are oncogenic in tumor development. Furthermore, mutations occur in DNA and RNA sequences during evolution, searching for the approximate palindromes appears meaningful. Therefore it is important to develop effective approaches to identify and characterize biological approximate palindromes.

  In this web, we developed a simple algorithm to find all exactly and approximate palindromes up to k errors (k is specified by the user) for three different types of RNA sequence data, i.e. mRNA sequences of fusion genes, human microRNAs (miRNAs) and long non-coding RNA sequences (lncRNA).

  The platform provides useful information for palindrome research on RNA sequences. First, under the "Search" button, user can search for the corresponding RNA palindrome according to the specified palindrome length or the percentage of each base pair. Second, in "Get palindrome" section, user can input any RNA sequence or natural language text with specified error bound, the platform will return, 1) the length of the corresponding longest approximate palindrome, 2) the corresponding longest approximate palindrome, and 3) the download option. Third, under the "Results" button, user can get the statistical analysis results of the three types of RNA sequences. These results include the distribution of the longest exact and approximate palindromes, the percentage of each base pair and the test results of homogeneity for the three types of RNA sequences etc. Finally, under the "Download" button, user can retrieve the raw RNA sequences in this study.