would be nice to see the graph statistics on lenght etc.. n every general structure changes of the genome...satelites.. telomeres... great use for computer science ..awesome..
Is it possible to take into account the number of times that a particular read (or overlapping part of a read) occurred to to help solve the problem of assembling the sequences like "a long long time"? -- it feels like a simple enough idea that I probably missed part in the lecture explaining why it doesn't work. 😅
That's the clearest step-by-step explanation i have ever heard or read! Thank you for sharing!
The string examples taken from various literature classics are perfect, great lecture!
38:54 de Brujin graph assemblers
At 5:55 the average coverage should be 5x, not 7x
would be nice to see the graph statistics on lenght etc.. n every general structure changes of the genome...satelites.. telomeres... great use for computer science ..awesome..
Still confused at 49:45
Is it possible to take into account the number of times that a particular read (or overlapping part of a read) occurred to to help solve the problem of assembling the sequences like "a long long time"? -- it feels like a simple enough idea that I probably missed part in the lecture explaining why it doesn't work. 😅
excellent lesson!
Excellent lecture! Thank u for sharing :)
Great lecture
Outstanding!!!
hahha the way i learned about konisberg bridges /nodes/ was the puzzle of the boat the farmer the fox and the seeds...
Great lecture