Question: A palindrome is a nonempty string over some alphabet that reads the same forward and backward. Examples of palindromes are all strings of length 1,
A palindrome is a nonempty string over some alphabet that reads the same forward and backward. Examples of palindromes are all strings of length 1, civic, racecar, and aibohphobia (fear of palindromes).
Give an efficient algorithm to find the longest palindrome that is a sub sequence of a given input string. For example, given the input character, your algorithm should return carac. What is the running time of your algorithm?
Step by Step Solution
3.45 Rating (164 Votes )
There are 3 Steps involved in it
We solve the longest palindrome subsequence LPS problem in a manner similar to how we compute the longest common subsequence Step 1 Characterizing a longest palindrome subsequence The LPS problem has ... View full answer
Get step-by-step solutions from verified subject matter experts
