11_LongestCommonSubsequence.ppt

11_LongestCommonSubsequence.ppt - Tuesday 19/10/10 Dr....

Info iconThis preview shows pages 1–12. Sign up to view the full content.

View Full Document Right Arrow Icon
CSC 30155 Tuesday 19/10/10 Dr. Daniel Hughes daniel.hughes@xjtlu.edu.cn
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Plan for Today l Feedback Response 10 minutes l Introduction to the Longest 30 minutes Common Subsequence Problem
Background image of page 2
Notes: l Do not forget that you have some assessment deadlines approaching l CS30155 Midterm Exam in Week 7. l Final Year Project due at the end of this Week. l We will cover the CS30155 exam in detail in this week’s tutorial slot. l Does anyone have any FYP questions?
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Feedback (1/4) l Simulation of matrix chain optimization is difficult. l Some students were absent. l We will practice this again on Thursday in the revision session.
Background image of page 4
Feedback (2/4) l Would like more materials on the algorithm being discussed. l You should use the recommended reading, but perhaps I can provide some additional material for revision on Thursday
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Feedback (3/4) l Some small mistakes in the Netbeans code. l I am not precious about my code! Send me along corrections and I will be glad to implement them. l As this is an extra resource, the time I can devote it it is limited.
Background image of page 6
Feedback (4/4) l Should we focus more on the construction of algorithms and their proofs? l I will try to add more material on this beginning tomorrow with the dynamic LCS algorithm. l But do not worry, there will be no surprises on the exams.
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
CSC 30155 The Longest Common Subsequence Problem Dr. Daniel Hughes daniel.hughes@xjtlu.edu.cn
Background image of page 8
Supporting Reading l Optional reading: l Cormen et al., Introduction to Algorithms , MIT Press, 2001, Chapter 15: String Matching (15.4)
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Problem Definition (1/2) What is a subsequence ? Definition 1: a subsequence of a given sequence is the given sequence with zero or more elements left out. Definition 2: a subsequence is a sequence that can be derived from another sequence by deleting some elements without changing the order of the remaining elements.
Background image of page 10
Problem Definition (1/2) l Given two sequences: X and Y, we say that a sequence Z is a common subsequence of X and Y if Z is a subsequence of both X and Y. l
Background image of page 11

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 12
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 32

11_LongestCommonSubsequence.ppt - Tuesday 19/10/10 Dr....

This preview shows document pages 1 - 12. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online