Longest Common Sub Seq

Document Sample
Longest Common Sub Seq Powered By Docstoc
					Longest Common Subsequence
Dynamic Programming

AOA
Ch. Muhammad Imran Razzak Lecture, Federal Urdu University of Arts, Science and Technology, Islamabad.

• Given two character strings A=a1 a2 a3 …… an and B=b1 b2 b3 … bm the problem is to find the Longest Common Subsequence.

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21


				
DOCUMENT INFO
Shared By:
Categories:
Tags:
Stats:
views:10
posted:8/25/2009
language:English
pages:21