Nyhetsflöde
Logga in till din kurswebb
Du är inte inloggad på KTH så innehållet är inte anpassat efter dina val.
Har du frågor om kursen?
Om du är registrerad på en aktuell kursomgång, se kursrummet i Canvas. Du hittar rätt kursrum under "Kurser" i personliga menyn.
Är du inte registrerad, se Kurs-PM för DD2450 eller kontakta din studentexpedition, studievägledare, eller utbilningskansli.
I Nyhetsflödet hittar du uppdateringar på sidor, schema och inlägg från lärare (när de även behöver nå tidigare registrerade studenter).
I will participate
HI,
Is it possible to shift the lecture at 6th to 15:00 instead of 13:00? I have another class at that time.
And I saw equal number of votes for the time slot 15:00 too.
Thanks.
Sorry, it is too late to change now.
Contrary to what I said in the lecture today, I have decided that it is too late to add homework problems.
Noted!
I guess most people selected today (Tuesday) 13-15 as their favorite time.
So is there lecture today or not?
For practical reasons, we will go with the second most popular alternative: tomorrow Wednesday at 13. I will get back to you with a room.
I think I managed to add confusion regarding parameters in this update, so I have made a second try. If you have looked at how to choose alpha, beta, and t today, please have a new look.
Unfortunately, the confusion is still not resolved...
Can we still assume that all branches in the tree have the same length? (I think in the original assignment it said 0.5)
In the latest version of the HW3:5, this is not specified any longer.
However, I already did my implementation under that assumption. Do we have to consider taking weighted trees (like ((a:1.0, b:1.3):0.5, (c:4.5, d:2.0):3.4):0.8; for instance) as inputs? Right now, I just ignored any weights specified in the newick tree, which makes the computation a lot easier.
Sorry for the ongoing confusion! You should jsut assume that over every branch, beta*t = 0.5.
I actually wanted you to avoid reading and working with weights, simply to make it easier.
Sorry,but it is not visible yet :-(
Since this is a computer wiz class I would assume that finding the homework would be one part of the assignment. It only requires a small haxx, and it is to go into HW1 or 2, and in the web address field exchange the number (1 or 2 respectively) for the number 3 (which is the current homework). I'll provide the link as well:
http://www.csc.kth.se/utbildning/kth/kurser/DD2450/algbio11/hw/3
Good luck. =)/
Thank you, got it!
Ahem, yes, Björn got it right, finding the questions was part of the assignment. I have however come to the conclusions that this might not be the proper way of examining on algorithmic bioinfo, so I have now added links in the left-hand menu.
Also: I have updated question 1.c to clarify that I only want positional variations to be modeled.
Did you include the your update to http://www.csc.kth.se/utbildning/kth/kurser/DD2450/algbio11/hw/2/ ?
Because right now, I don't recognize any changes in task 2b compared with my printout from last week.
Aw, you are right, I forgot to copy my edited copy over to the real file. Should work now.
At the first lecture, it was specified that the total number of points for each of algorithm design and implementation was 600 points. Here it says 500. Could you please check this?