Computational Biology

Scribe Notes for Class 21
June 20, 2000

Scribe: S. Oak


Today's Talks


Today's Topics

 
  • The talk on Shortest common superstring  was concluded with a brief description about Epsilon-d  CONTIG problem and the algorithm
  • The Algorithm snapshot :
  • Make suffix tree
  • Eaxamine the suffix tree at depth d ( overlaps with atleast d matches)
  • If overlap is  ' w'  add the pair to priority queue.
  • Take K best strings.
  • Calculate the edit distance
  • Count the number and type of edits to have a consesus vote.
  • The talk on Modeling the cell cycle would cover
  • Modeling the cell cycle using differential equations.
  • Topics discussed
  • The Cell cycle consists of phases, viz, G1, S , G2, M.
  • The usage of Differential equations (Eulers method).
  • The neat & clear diagram for cell cycle is here

  • Today's Sources


    Please report any problems found in these pages to:
    CS6104 Account (cs6104@courses.cs.vt.edu)