Identification and Analysis of Palindromes for RNA Sequences

• Main Authors: Chien-Hung Huang, Sheng-Jia Weng, Korla, Praveen Kumar, Jywe-Fei Fang, Tsai, Jeffrey J. P., Kurubanjerdjit, Nilubon, Ka-Lok Ng
• Format: Conference Proceeding
• Language: English
• Subjects: Approximation algorithms; Bioinformatics; Cancer; DNA; Dynamic programming; Fusion gene; Genome instability; Genomics; MicroRNA; Palindromes; RNA; Silicon
• ISSN: 2471-7819
• DOI: 10.1109/BIBE.2016.35

A palindrome is a string of the form S = A 1 A 2 or S = A 1 aA 2 , where A 1 and A 2 are substrings of S and the reverse of A 2 exactly matches with A 1 . DNA palindromes show direct influence on tumerogenesis due to the formation of DNA palindromes at microRNA genes, which involve in tumor development. Furthermore, RNA palindromes play a crucial role in genomic instability and gene amplification in some human cancers. Therefore, it is important to develop effective approaches to identify and characterize biological approximate palindromes. In this paper, we developed a simple algorithm to find all the exact and approximate palindromes up to k errors (k is specified by the user) for the two different types of RNA sequence data, i.e. mRNA sequences of fusion genes and human microRNAs (miRNAs). We confirmed that the palindromes in RNA sequences are A-U rich. According to the Kolmogorov-Smirnov test, it was found that miRNA has a frequency distribution of palindromes different from the fusion genes' mRNAs. The proposed algorithm is easy to implement, which provides an effective tool for investigating the relationship between palindromes and cancer biology.