1 / 7

# Longest Common Subsequence - PowerPoint PPT Presentation

Longest Common Subsequence. Chris Carpenter Charles Cobb Lance Hymel. Problem. Given two strings, find the longest subsequences (LCS) shared by both strings. Dynamic Programming Solution. Construct a n 1 ×n 2 table Fill in table Top-left to bottom-right

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.

## PowerPoint Slideshow about ' Longest Common Subsequence' - conlan

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

### Longest Common Subsequence

Chris Carpenter

Charles Cobb

Lance Hymel

• Given two strings, find the longest subsequences (LCS) shared by both strings.

• Construct a n1×n2 table

• Fill in table

• Top-left to bottom-right

• Increment whenever match is found

• Bottom-right number is length of LCS

• Scan table bottom-right to top-left

• Locations where number decreases diagonally are included in LCS

Hirschberg Solution (cont)

• Recursively scan

• Still runs in linear time

• Uses O(min(string1, string2)) memory

• File comparison

• Source-code control

• Insertion, Deletion, Merging

• Bioinformatics

• Sequence analysis

• Comparative genomics

• Sequence analysis is the process of subjecting a DNA, RNA or peptide sequence to any of a wide range of analytical methods

• The analytical methods include :

• Sequence Alignment

• Methodical biological database searches