Convolutions of String Data Structures: A Case Study of Finding Number of Palindrome Substrings in a String

In computer science, substring search or string Matching is a vulnerable problem when text resources are very large. Productivity of diverse scraping applications depend on the effectiveness of searching algorithms. Palindrome string finding is one of these problems which has its use in many applications. The problem is about finding the number of palindrome substrings within a string. This paper discusses a naive and dynamic programming-based algorithm for finding several palindrome strings. The time complexity of algorithm has also been analyzed and an effort has been made to improve it.