Abstract

In this paper, the computation of palindrome detection has been studied. The presented approach is related to the concept of the Longest Previous Reverse Factor (LPrF) table. This table stores the longest previous reverse factor occurring at each position of a string. In addition, this table is useful for data compression and is related to Ziv-Lempel factorization, a well-known technique for data compression. A method that is presented for computation of the palindrome detection based on the LPRF table applied the Augmented Position Heap of a given string. This algorithm is a linear time and a linear memory space. This algorithm is useful for RNA secondary structure prediction and for data compression.