Abstract

Detecting palindromes in DNA sequences is a fundamental problem in computational biology with implications for understanding genomic instability. DNA sequences containing long adjacent inverted repeats (palindromes) are associated with chromosomal rearrangements. In this article, we present the concept of using the LPrF (Longest Previous reverse Factor) table to develop an algorithm for efficiently detecting palindromes in strings, particularly in long DNA and RNA sequences. To improve processing time and reduce computational overhead, we utilize the suffix heap data structure for data preparation before applying the algorithm. These two components are integrated into a user-friendly way of detecting palindromes in DNA sequences, a web-based tool that streamlines the process, saving time and computational resources.