Suppose that c1,c2,...., cp is a longest common
Chapter 10, Problem 15E(choose chapter or problem)
Problem 15E
Suppose that c1,c2,...., cp is a longest common subsequence of the sequences a1,a2,...., am and b1,b2,...., bn.
a) Show that if am = bn, then cp = am = bn and c1,c2,..., cp-1 is a longest common subsequence of a1, a2,..., am-1 and b1,b2,.... bn-1 when p > 1.
b) Suppose that am ≠ bn. Show that if cp ≠ am,then c1,c2,....cp is a longest common subsequence of a1, a2,..., am-1 and b1 ,b2...... bn and also show that if cp ≠ bn. then c1. c2...... cp is a longest common subsequence of a1.a2..... am and b1.b2....,bn-1.
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