![]() Oct 11/ Kyle/Yujing: Yujing asked a series of questions about the logisitic map, music and Saskatchewan. Amir continued his presentation of the alignment problem in bioinformatics, introduced the idea of deletion, insertion and copying mutations in DNA transcription/translation, and stated the Needlemann-Wunsch and Smith-Waterman theorems. 2: Mahmoud won alternate search engine trivia. After introducing the problem, Amir discussed the naive algorithm and dynamic programming principle for the L.C.S problem before leaving us on a cliffhanger waiting to see the application to mRNA transcription. 1: Following Google themed trivia where Kyle won 2-0, Amir spoke to us about the longest common sequence (L.C.S) problem from the computer science and microbiology perspectives. Fall is in the air here at McGill, bringing with it crisp mornings, frisbee in the lower field and the CAMBAM student seminar! The seminar takes place bi-weekly in room 1120 of Burnside Hall from 4-5pm.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |