This is the presentation for Efficient algorithm about Longest common subsequence.
What is LCS?
The longest common subsequence (LCS) problem is to find the longest subsequence common to all sequences in a set of sequences (often just two).
The application of LCS is for finding the common in text string meaning that sometime it used for checking that the code from 2 source are the same or not (so crew for copy, right?) or finding the common in DNA if you want to find if someone is your relative or not (LOL).
How to do this?
Follow my slide is okay (haha): https://docs.google.com/leaf?id=0B-Ls4RhAgiHeMThmYTYxOWQtZTdkZi00NDNjLWI0NDUtZTllMDY0Y2RhMTM3&hl=en_US
For the flash slide to see step by step: Click the arrow at the bottom to see the step
What is LCS?
The longest common subsequence (LCS) problem is to find the longest subsequence common to all sequences in a set of sequences (often just two).
The application of LCS is for finding the common in text string meaning that sometime it used for checking that the code from 2 source are the same or not (so crew for copy, right?) or finding the common in DNA if you want to find if someone is your relative or not (LOL).
How to do this?
Follow my slide is okay (haha): https://docs.google.com/leaf?id=0B-Ls4RhAgiHeMThmYTYxOWQtZTdkZi00NDNjLWI0NDUtZTllMDY0Y2RhMTM3&hl=en_US
For the flash slide to see step by step: Click the arrow at the bottom to see the step
No comments:
Post a Comment