Let L (i. j) denote the length of a longest common
Chapter 10, Problem 16E(choose chapter or problem)
Let L (i. j) denote the length of a longest common subsequence of a1.a2 ......ai and b1.b2..... bj. where 0 ? i ? m and 0 ? j ? n. Use parts (a) and (b) of Exercise 15 to show that L(i. j) satisfies the recurrence relation L(i. j) = L (i?1 . j ?1) + 1 if both i and j are nonzero and ai = bi. and L(i. j) = max (L(i. j ? 1), L (i – 1, j)) if both i and j are nonzero and ai? bi, and the initial condition L(i. j) = 0 if i= 0 or j =0.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer