Difference between revisions of "BCB410"

From "A B C"
Jump to navigation Jump to search
Line 129: Line 129:
 
<tr class="sh">
 
<tr class="sh">
 
<td><b>Week</b></td>
 
<td><b>Week</b></td>
 +
<td><b>Date</b></td>
 
<td><b>Presenter</b></td>
 
<td><b>Presenter</b></td>
 
<td><b>Topic</b></td>
 
<td><b>Topic</b></td>
Line 137: Line 138:
 
<tr class="s1">
 
<tr class="s1">
 
<td>1</td>
 
<td>1</td>
 +
<td>Sept. 26</td>
 
<td>Neda Raji</td>
 
<td>Neda Raji</td>
 
<td>High-throughput sequencing</td>
 
<td>High-throughput sequencing</td>
Line 143: Line 145:
 
<tr class="s2">
 
<tr class="s2">
 
<td>2</td>
 
<td>2</td>
 +
<td>Oct. 3</td>
 
<td>Andrei Soltan</td>
 
<td>Andrei Soltan</td>
 
<td>unix tools<sup>*</sup></td>
 
<td>unix tools<sup>*</sup></td>
Line 149: Line 152:
 
<tr class="s1">
 
<tr class="s1">
 
<td>3</td>
 
<td>3</td>
 +
<td>)Oct. 10</td>
 
<td>Inna Dimenshtein</td>
 
<td>Inna Dimenshtein</td>
 
<td>'''R''' programming<sup>*</sup></td>
 
<td>'''R''' programming<sup>*</sup></td>
Line 155: Line 159:
 
<tr class="s2">
 
<tr class="s2">
 
<td>4</td>
 
<td>4</td>
 +
<td>Oct. 17</td>
 
<td>Andrew Lugowski</td>
 
<td>Andrew Lugowski</td>
 
<td>Text mining</td>
 
<td>Text mining</td>
Line 161: Line 166:
 
<tr class="s1">
 
<tr class="s1">
 
<td>5</td>
 
<td>5</td>
<td>Lorenz Breu</td>
+
<td>Oct. 27</td>
<td>Network metrics</td>
+
<td><i>cancelled</i></td>
 +
<td>&nbsp;</td>
 
</tr>
 
</tr>
  
 
<tr class="s2">
 
<tr class="s2">
 
<td>6</td>
 
<td>6</td>
 +
<td>Nov. 7</td>
 
<td>Samuel Law</td>
 
<td>Samuel Law</td>
 
<td>BioPython</td>
 
<td>BioPython</td>
Line 173: Line 180:
 
<tr class="s1">
 
<tr class="s1">
 
<td>7</td>
 
<td>7</td>
<td>Kyle Kim</td>
+
<td>Nov. 14</td>
<td>Correlation discovery in large datasets<sup>*</sup></td>
+
<td>Lorenz Breu</td>
 +
<td>Network metrics</td>
 
</tr>
 
</tr>
  
 
<tr class="s2">
 
<tr class="s2">
 
<td>8</td>
 
<td>8</td>
 +
<td>Nov. 21</td>
 
<td>Dylan Bethune-Waddell</td>
 
<td>Dylan Bethune-Waddell</td>
 
<td>Pattern discovery<sup>*</sup></td>
 
<td>Pattern discovery<sup>*</sup></td>
Line 185: Line 194:
 
<tr class="s1">
 
<tr class="s1">
 
<td>9</td>
 
<td>9</td>
 +
<td>Nov. 28</td>
 
<td>Taras Gordiyenko</td>
 
<td>Taras Gordiyenko</td>
 
<td>High performance computing</td>
 
<td>High performance computing</td>
Line 191: Line 201:
 
<tr class="s2">
 
<tr class="s2">
 
<td>10</td>
 
<td>10</td>
 +
<td>Dec. 5</td>
 
<td>Chiho Kwon</td>
 
<td>Chiho Kwon</td>
 
<td>Clustering<sup>*</sup></td>
 
<td>Clustering<sup>*</sup></td>
Line 197: Line 208:
 
<tr class="s1">
 
<tr class="s1">
 
<td>11</td>
 
<td>11</td>
 +
<td>Dec. 5</td>
 
<td>Harun Mustafa</td>
 
<td>Harun Mustafa</td>
 
<td>Cluster quality metrics</td>
 
<td>Cluster quality metrics</td>

Revision as of 23:44, 25 October 2012

BCB410 2012



Objectives and Participants

The "Applied Bioinformatics" course is offered as a part of the BCB curriculum to ensure that our students know enough about application issues in the field to be able to put their knowledge into practice in a research lab setting. This is to support the Specialist Program goal: to prepare students for graduate studies in the discipline.

As a required course in the BCB curriculum, BCB410 assumes the prerequisites and goals of fourth-year students in the BCB Specialist Program. Other students may participate but they may need to catch up on prerequisites in computer science or life-science courses that BCB students have taken at this point. They may also need to consider whether their objectives match the course objectives well. Generally speaking, this is an advanced course that presupposes familiarity with programming principles, algorithm analysis, and methods of modern systems biology, as well as introductory knowledge of linear algebra, graph theory, information theory, statistics as well as molecular–, structural– and cellular biology.


Organization

 

Dates and Location

 

Classes meet Wednesdays between 10:00 and 12:00 in MS 2394 throughout the Fall Term.

 

Contact

 

Contact within the class is easiest via the Google Group that you have been subscribed to.

 

Marking

 

Activity Weight
Design and coordination of your unit 20 marks
Delivery and contents of presentation 20 marks
Quality of exercises/assignments 30 marks
Participation 10 marks
Final exam 20 marks
Total 100 marks

 

Contents

 

A syllabus of learning units

 

Working from a general collection of topics in the field, we identify learning units that are of the greatest interest and greatest relevance for the students in the class. We jointly select the most suitable topics. Every student in class will take responsibility for development and delivery of one of the learning units.

 

Unit contents and delivery

The detailed contents for each unit is to be be discussed with the coordinator. Each student will to lead a two hour session on their topic.

Presenter's responsibilities include[1]:

  • Outline of the unit contents, to be completed at least three weeks in advance; This is to include:
    • a detailed lecture outline that includes an introduction, discussion of algorithms, presentation of examples, exposition of practical- and implementation issues and an outlook on future developments in the field;
    • suitable pre-reading material;
    • an outline of exercises for the class;
  • Iteration of the unit contents with the coordinator, to be completed at least two weeks in advance.
  • Developing a set of exercises (iterated with the coordinator) around the implementation of the topics , at least one week in advance;
  • Communication of pre-reading materials to your classmates, at least one week in advance;
  • Delivery of your lecture at a sufficiently technical level to be appropriate for an advanced fourth-year course and engaging the class in discussion;
  • Communication of exercise materials to the class, at or directly after the lecture;
  • Drafting a final-exam question that tests the successful completion of the exercises, at the latest one week after the lecture.

Audience responsibilities include:

  • Pre-reading before class;
  • Active participation in the discussion;
  • Feedback on the exercises and completion in due time.


Schedule

This schedule exceeds the available dates of the term and additional time slots will be agreed on, as required, during the second half of the term. Students may swap their presentation dates among themselves but the coordinator must be informed of swaps.

 

Week Date Presenter Topic
1 Sept. 26 Neda Raji High-throughput sequencing
2 Oct. 3 Andrei Soltan unix tools*
3 )Oct. 10 Inna Dimenshtein R programming*
4 Oct. 17 Andrew Lugowski Text mining
5 Oct. 27 cancelled  
6 Nov. 7 Samuel Law BioPython
7 Nov. 14 Lorenz Breu Network metrics
8 Nov. 21 Dylan Bethune-Waddell Pattern discovery*
9 Nov. 28 Taras Gordiyenko High performance computing
10 Dec. 5 Chiho Kwon Clustering*
11 Dec. 5 Harun Mustafa Cluster quality metrics


* Older material and/or previous lectures on these topics are available. Coordinate with me ...


 

Notes

  1. Details may vary as required, by mutual agreement.