Web Service for Palindrome Detection from Algorithm Sequence

This research focuses on developing a Web Service for Detection Palindromes. The system incorporates the innovative concepts of the LPrF table and the Online Position Heap data structure to identify palindromic sequences efficiently. Palindromes are symmetric strings or sequences that read the same forward and backwards. They have implications in various fields, including genetics and computer science. The system allows users to input genome sequences and detect palindromes by clicking the “Find Genome” button. The calculation time depends on the number of characters in the input sequence. The web service is developed using JavaScript, ensuring platform independence and smooth operation over the internet. This research contributes to academia by providing an efficient and versatile solution for detecting palindromes in alphabetical order.