Question

MT: Longest Palindromic Subsequence (LPS) - Example Homework. Unanswered Assuming indexing begins with 0, what is the value of LPS[1][7] for the string ABCABCABCABCABCABC? Numeric Answer: Unanswered Submit

Answer 1

Let S[0..n-1] be the input sequence of length n
then LPS[i][j] be the length of the longest palindromic subsequence of S[i..j].

Given sequence = ABCABCABCABCABCABC
LPS[1][7] will give the length of the longest palindromic subsequence in
[BCABCAB]
longest palindromic subsequence possible are {BABAB , BACAB}
Therefore length = 5
LPS[1][7] = 5