动态算法优化：长回文子序列问题与实现.pdfVIP

DynamicProgrammingMoreExercise

December7,2013

LongestPalindromeSubsequence

Apalindromeisanonemptystringcoverssomealphathatreadsthesame

forwardandbackward.Exampofpalindromesareallstringoflength

1,”civic”,”racecar”,and”aibohphobia”(ofpalindromes)Givenan

efficientalgorithmtofindthelongestpalindromethatisasubsequenceofa

giveninputstring.Forexample,givetheinput:”BBABCBCAB”,your

algorithmshouldreturn”BACBCAB”

Parta:LetX[0..n−1]betheinputstringandL(0,n−1)bethelength

ofthelongestpalindromicsubsequenceofX[0..n−1].

DefineL(i,j)bethelengthofthelongestpalindromicsubsequenceofX[i..j],

WritethebasecaseandrecursiveequationsforL(i,j)



1(i==j)(BaseCase)



2(X[i]==X[j],j==i+1)(BaseCase)



L(i,j)=1(j==i+1,X[i]!=X[j])

L(i+1,j−1)+2(X[i]==X[j],ji+1)







max(L(i+1,j),L(i,j−1))(otherwise)

Partb:Usethe”BBABCBCAB”asexamplestring,fillthefollowingtable.

Table1:Longestpalindromesubsequence

i\j012345678

0122235557

110333357

21003355

310