Abstract
In this article, we present an efficient algorithm for linear-time suffix heap construction to use in detecting a pattern of palindrome, which can be applied in a field of bioinformatics for detecting a pattern that may denote a cancer cell. We used the concept of the Longest Previous reverse Factor (LPrF) table and suffix heap construction to develop the algorithm. From such, we obtained a new algorithm that demonstrates efficient time and space attributes for detecting all reverse substrings in a string. The palindrome detection algorithm runs with high performance in data processing.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call