that is also a palindrome. For example, the longest palindromic substring of "bananas" is "anana". The longest palindromic substring is not guaranteed...

, find a longest string which is substring of both S {\displaystyle S} and T {\displaystyle T} . A generalization is the k-common substring problem. Given...

solve the longest palindromic substring, the k-factorization problem (can a given string be divided into exactly k palindromes), palindromic length of...

completely. It is possible to find the longest palindromic substring of a given input string in linear time. The palindromic density of an infinite word w over...

sequences (often just two sequences). It differs from the longest common substring: unlike substrings, subsequences are not required to occupy consecutive...

operations can be performed quickly, such as locating a substring in S {\displaystyle S} , locating a substring if a certain number of mistakes are allowed, and...

has an optimal substructure. Longest common subsequence problem Longest increasing subsequence Longest palindromic substring All-Pairs Shortest Path Any...

representing the substring index of a given string which allows the storage, processing, and retrieval of compressed information about all its substrings. The suffix...

the riddle of Chinese characters, where partial characters instead of substrings are clued and combined. Clues given to the solver are based on various...