CS 374 - Algorithms in Biology
Fall 2004

 

 

This course will cover algorithms and computational models applied to molecular biology. Current, exciting algorithms from a variety of biological areas will be covered. The topics should be of interest to computer scientists and biologists alike. In Fall 2004 we will cover topics from genomics and evolution of DNA, such as sequence comparison methods, annotating DNA with genes and evolutionary important elements, genomic rearrangements, microarray analysis, and new sequencing technologies. We will also cover topics from protein structure, protein surface and interactions modeling, multiple alignment of proteins, phylogenetic trees, and DNA-based computation. The course will consist primarily of student presentations of topics in the syllabus, which will be prepared with the help of the instructor. Students will help forming the syllabus, by choosing the topics they would like to present.

          Lecture: TTh 11:00AM-12:15PM, Clark Center S361

1.     The main course requirement is to select a topic and prepare a presentation based on 2 papers on the topic. The instructor and TA will meet with each student to help with the preparation, and ensure that the resulting presentation will be interesting and accessible to students in the class who are not experts in the given topic. Most of the topics have a strong algorithmic flavor, but some topics are more geared towards biology. Please sign up for topics to present, on a first-come first-serve basis (see Topics below).

2.     The second requirement is scribing a lecture.  Lecture notes should provide students who are taking the class a useful resource for remembering the material presented. Ideally, lecture notes should be written up in a way so that they are readable by students of next year who did not necessarily read the papers that were presented. For formatting, here is a sample of how lecture notes should look like in terms of format and organization. We suggest that you use this as a template to prepare your lecture notes in Word. (Please do not read for content because we edited the original in ways that do not make sense in order to shorten it and put it in a specific format.)

Please sign up for scribing, on a first-come first-serve basis. To do so, please email both instructor and TA with subject "CS374, signing up for scribing". Lecture notes are due 1 week after the presentation.

3.    As a third requirement, you should select one of the first 10 lectures, and one of the rest. For this lecture, you should find one paper in addition to the 2 presented, which is related to the topic. It is preferable to find recent papers (2000-2004). Then, you should write a 1-page summary of what the paper presents and how it relates to the other two. The deadline for that summary is 1 week from the time of your selected lecture, and it will be distributed to class 2 weeks from that lecture, after we edit it together.  If you select a topic from the last week of class, then the edited version will not be distributed in class but will still be made available online.

Here is a sample structure of this short summary:

- Paper reference

- Abstract: in your own words (preferably simple description), what does the paper present

- Discussion: how do these results relate to the topic? Is it an advance over what was described, a different approach, and what are the main advantages/disadvantages?

4.    As this is a seminar-style class, attendance is mandatory, and each student can miss up to 2 classes without affecting his/her grade.

Taking the class for 2 units: If you take the class for 2 units, you can drop (2) or (3) above; or, in case enrollment is too high we will consider dropping (1) if you prefer.

Questions should be sent to the instructor and TA directly with email, or communicated to course staff in person after lecture or during office hours.
 

 

Topics

Students will select topics from the following list. Also, they will sign up for a date of presentation. All this will be done on a first-come first-serve basis. Please email both instructor and TA with subject "CS374, signing up for presentation". Each lecture will cover 2 papers. Underlined topics have been assigned.

  Topic Papers
1 Genomic rearrangements

 

2 Repetitive DNA detection and classification
3 Indexing large databases for string similarity search
4 Mapping genomes onto each other -- Synteny detection
5 Regulatory motif finding

 

6 Protein structure and prediction

 

7 Protein classification
8 Phylogenetic trees
9 Haplotype reconstruction
10 Finding elements in DNA that are conserved by evolution
11 Protein multiple alignment
12 Aligning alignments
13 Finding genes based on comparative genomics
14 Mining the medical literature
15 Protein docking and interactions modeling
16 Noncoding RNA Genes

 

17 Microarray analysis and clustering
18 Modeling regulatory networks
19 Classic Papers

This presentation, if selected by a student, will be different from usual. We will cover a historical perspective based on three classic papers on Chromosomes (1903), Genes (1933), and the Central Dogma of molecular biology (1970)

20 DNA-based computation

 

21 Transforming cells into automata

                                                                                                        

Schedule

The schedule will be filled-in as students sign up for topics. Click on the scribe's name for lecture notes.  (We try to make one set of lecture notes per talk, but due to some conflicts and problems with scheduling, there are some gaps while a lecture can have more than two scribed versions.)

Thanks to all students for a great class this year!  The material below will be kept online (disclaimer: we have not edited it, and even though students did a great job preparing presentations and lecture notes, there are, unavoidably, many errors).

  Topic Date Presenter Short Paper Summaries Scribe

1

Introduction

Tuesday, September 28 Serafim Batzoglou   Marina Sirota
2

Biological Background

Thursday, September 30 Omkar Deshpande   Maria Teresa Gil Lucientes
3

DNA Sequencing and Assembly; references 1, 2

Tuesday, October 5 Serafim Batzoglou   Ronnie Sebro
4

Mapping Genomes onto Each Other--Synteny Detection

Thursday, October 7 Aswath Manohar   Chirag Bhatt
5

Transforming Cells into Automata

Tuesday, October 12 Florian Buron 1 Vince Dorie

6

Mining the Medical Literature

Thursday, October 14

Chirag Bhatt

1, 2

John Griffin

Samuel Pearlman

7 Protein Multiple Alignment Tuesday, October 19 Marina Sirota 1, 2, 3 Olga Russakovsky
8 Haplotype Reconstruction Thursday, October 21 Ronnie Sebro 1, 2  
9 Protein Structure and Prediction Tuesday, October 26 Samantha Chui 1, 2, 3 Michael Tung

10

10b

Classic Papers in Genetics

Phylogenetic Trees

Thursday, October 28

Double lecture & Lunch

Olga Russakovsky

Michael Tung

1

Stephen Guo

11 Genomics Rearrangements Tuesday, November 2 Dan Woods 1, 2 Yu Bai
12 Protein Docking and Interactions Modeling Thursday, November 4 Maria Teresa Gil Lucientes 1 William Liu
13

Modeling Regulatory Networks

Protein Classification

Tuesday, November 9

Double lecture & Lunch

John Griffin

John Shedletsky

1, 2, 3, 4

Robin Raffard

14 Aligning Alignments Thursday, November 11 Soni Mukherjee   John Shedletsky
15 Microarray Analysis and Clustering Tuesday, November 16 Yu Bai 1, 2 George Asimenos
16 Finding Elements in DNA Conserved by Evolution Thursday, November 18 Penka Markova   Florian Buron

17

17b

Regulatory Motif Finding

Noncoding RNA

Tuesday, November 23

Double lecture & Lunch

Samuel Pearlman

William Liu

1, 2, 3

Dan Woods

Samantha Chui

18

Finding Genes based on Comparative Genomics

Noncoding RNA

Tuesday, November 30

Double lecture & Lunch

Robin Raffard

Vince Dorie

  Penka Markova

19

19b

DNA-based Computation, Part I and II

Amorphous Computation

Thursday, December 2

Double lecture & Lunch

Stephen Guo

George Asimenos

1, 2, 3

Soni Mukherjee

Aswath Manohar