Scribe: C. Wingrave

Today's Handouts and Announcements

Today's Topics

• Sorting Problem:
  Instance : Array A[1..n] or integers
  Solutions: B[1..n] a permutation of A, satisfying B[1] < B[2] < ... < B[n]
  
• Merge Sort:
  divide and conquer: break into subproblem, solve each recursively, combine solutions on way out
  
• Complexity of Algorithm
  time and space
  
• Minimum Spanning Tree
  
• Dynamic Programming:
  Longest Common Subsequence
  Instance : two sequences X[1..m],Y[1..n] of symbols
  Solutions: length of longest common subsequence of X and Y
  
  Sequences:
  CACGG
  ACATCGG
  

  	C	A	C	G	G
  A	0	1	1	1	1
  C	1	1	2	2	2
  A	1	2	2	2	2
  T	1	2	2	2	2
  C	1	2	3	3	3
  G	1	2	3	4	4
  G	1	2	3	4	5

Today's Sources

• Setubal and Meidanis: Chapter 2.

• Salzberg, Searls, and Kasif: Chapter 2.

• One bullet each for any research papers or web sites relevant to today's class.