Tue+Thu, 9:30-11:00 in DMP 301
First class: Tue, 2006/01/08
Holger H. Hoos
E-mail: hoos "at" cs.ubc.ca
Oral exams will take place on the Monday the 21th and Tuesday the 22st of April, 2008
in room X541 (Holger's office). Oral exams will be around 15 minutes long, and a 5 minute
extension is allowed if the instructor deems it necessary. If you cannot attend your given
time slot, contact Holger immediately.
We strongly encourage you to arrive 15 minutes prior to your exam start time, and plan
your trip to campus carefully. You are responsible for arriving to your exam on time.
Because of the tight schedule, we won't be able to accommodate any reschedule delays.
The exams schedule is as follows:
Andrew Carbonetto (acarbo "at" cs.ubc.ca)
New office hours for week of April 14th:
Wed, 14:00-16:00 (ICICS/CS X530)
Oral exams will take place on the Monday the 21th and Tuesday the 22st of April, 2008 in room X541 (Holger's office). Oral exams will be around 15 minutes long, and a 5 minute extension is allowed if the instructor deems it necessary. If you cannot attend your given time slot, contact Holger immediately.
We strongly encourage you to arrive 15 minutes prior to your exam start time, and plan your trip to campus carefully. You are responsible for arriving to your exam on time. Because of the tight schedule, we won't be able to accommodate any reschedule delays.
The exams schedule is as follows:
|start time||end time||student|
|start time||end time||student|
|9:10||9:30||Ben Vander Valk|
|11:20||11:40||King Long Tse|
|13:00||13:20||Jenny Qing Qian|
About this course:
Bioinformatics involves the application of computational methods to answer or provide insight on questions in molecular biology. This course provides an introduction to the design and analysis of algorithms for bioinformatics applications. Topics covered will include sequence alignment, phylogenetic tree reconstruction (parsimony and distance-based methods), prediction of RNA and protein structure, gene finding, and motif finding. Algorithmic techniques that will be discussed include dynamic programming and heuristic search methods, as well as combinatorial algorithms for exploration of graphs and trees. Statistical models of molecular sequence and structure, such as hidden Markov models and stochastic context free grammars, and associated algorithms, will also be covered.
CPSC 320 and six credits of BIOL beyond BIOL 111, or equivalent. Experience with design and analysis of algorithms is essential for this course. Related texts listed below, such as “Molecular Biology of the Cell”, will be useful for those who need to catch up on biological background. The algorithms texts by Cormen et al. and by Kleinberg and Tardos provide useful background on combinatorial algorithms, including graph algorithms and dynamic programming algorithms. The text by Hoos and Stützle is a more advanced text which provides very useful background on local search techniques.
Durbin, Eddy, Krogh, Mitchison: Biological Sequence Analysis. Cambridge University Press, 1998
You can access the course wiki here: Course Wiki
These pages are currently viewable by anyone. All members of the course may edit these topic pages and attach shared material. To do so, your CS TWikiName (a registered ID of the form of FirstnameLastname) must be added to the course access list by the instructor or TA.
To get a CS TWikiName:
Students with CS Undergrad Accounts (ex a1a1): register here and then forward the TWikiName you used to Andrew (or Holger). NOTE: when you log in, you'll use your registered email address and password, not your TWikiName.
Students with CS Grad Accounts: your cs login and password gains you some levels of access throughout the CS Twiki, however your TWikiName is how you are granted access to particular protected areas. Register here and forward your TWikiName to Andrew (or Holger).
Once you've been added to the group access list, you should be able to edit as well as view the cs445 web pages.
However, you still need to authenticate yourself for any given session. To trigger the logon dialog, use e.g.
rather than https://bugs.cs.ubc.ca/cgi-bin/twiki/view/CS445/
Remember that the login dialog wants your email address (the one you registered if it's non-cs, otherwise your department logon) not your twikiname. Users don't ever have to explictly use their twikinames, which are for internal authentication.
Missed Course Work and Academic Misconduct:
Students will prepare a mini-project on a subject related to the course (computer science and bioinformatics). Students will form a group of 2, and no other sized group will be accepted except under strict circumstances. The mini-projects will include a 1/2 page topic outline, a 10 minute presentation (+ up to 5 minutes of questions), and a 3 page report.
Groups should include 2 references. References should either be a literature paper or similar reputable source (ie not wikipedia). If you are unsure whether a reference is acceptable, please consult either Holger or Andrew. The names and student numbers of both groups members should be included. No two groups may select the same reference or topic. Overlap will be resolved on a "first come, first served" basis.
The topic selected should be related to the course material (see the course outline), a topic from any of the text references (including the course textbook) or a topic pertaining to algorithms in bioinformatics. Topics should be above and beyond the material explained in class. If you unsure whether a topic is acceptable, do not hesitate to contact either Holger or Andrew.
|April 1st, 2008|
|FASTA vs BLAST|
||Lingxiao Lewis Zhou|
|How to Find Optimal Alignments in Linear Space|
| Neighbor Joining Method: A Popular Algorithm for |
Constructing the Topology of Phylogenetic Trees
| MSAID: multiple sequence alignment based |
on a measure of information discrepancy
Ben Vander Valk
|Using Sequence Alignment to Discern Germline|
Gene Fragments of Antibody Sequences
|April 3rd, 2008|
||Jenny Qing Qian|
|Algorithms for Short Sequence Assembling|
||King Long Tse|
|Protein Secondary Structure Prediction|
|The Evolution of Multiple |
Sequence Alignment Programs
|April 8th, 2008|
|Parital Order Multiple Sequence Alignment|
|Parallel Strategies for Sequence Alignment|
|Prediction of Conserved RNA Secondary|
Structure within Protein-coding Regions
|Haplotype Inference Algorithms|
|Local Multiple Sequence Alignment |
using the Biclustering Technique
Note: If two groups would like to switch presentation slots, please send an email to Andrew or Holger cc'ing members of both groups.