'Lcs problem' presentation slideshows

2. Comparing biological sequences : sequence alignment

822 views • 64 slides

CS 330 - Algorithms Dynamic programming II

CS 330 - Algorithms Dynamic programming II. Another Example. Biologists need to measure how similar strands of DNA are to determine how closely related an organism is to another. They do this by considering DNA as strings of letters A,C,G,T and then comparing similarities in the strings.

569 views • 56 slides

Dynamic Programming: Sequence alignment

518 views • 48 slides

Longest Common Subsequence

Longest Common Subsequence. Definition: The longest common subsequence or LCS of two strings S1 and S2 is the longest subsequence common between two strings. S1 : A -- A T -- G G C C -- A T A n=10

782 views • 21 slides

L ongest C ommon S ubsequence

L ongest C ommon S ubsequence T.H. Cormen et al., Introduction to Algorithms , MIT press, 3/e, 2009, pp. 390-396 Example : X =abadcda, Y =acbacadb bcd is a common subsequence of X , Y X =a b ad cd a , Y =ac b a c a d b abacd is an LCS of X , Y (not unique)

224 views • 12 slides