ADS1: De Bruijn graphs and Eulerian walks

[@xinking2644]

i can't believe my eyes, you are the author of bowtie! good job, i learned a lot from your code!

[@zoltanbulletproof]

Thank you so much, and congratulations you did a great job explaining this!

[@USA-iw6ck]

The best explaination for De Brujin😃

[@davide1913]

Clear and welcoming videos, thank you!

[@carolinadiaz7058]

Excellent explanation. Thank you very much!

[@choijhkorea]

shouldn't there be another self-directed edge for BB?

[@WIN_1306]

best explanation ever

[@JoeTaber]

If you add an A at the end of the genome string, then the eulerian walk is no longer unique; i.e. you can start from any node and still walk each edge once.

[@Totema.]

What would represent an "eulerian CYCLE" (is an eulerian walk but start node, of the walk, is the same as the end) in a "De Bruijn" graphe, for a genome sequence ?

[@niloufaraminian511]

you just saved my life!

[@Caroline-vy1co]

Thanks, great explanation.

[@고양이맛고양이]

Oh.....thank you so much!!!

[@healthy_madness]

Thanks!

[@콘충이]

Thank you!!

[@treebeardization]

Doesn't this just reconstruct the initial read that we already have? I don't see how this tells us anything we don't already know.

[@ryandikdan]

Anyone else hearing Tumor?

[@Grassmpl]

Wrong definition! Digraph is eulerian iff it has an eulerian cycle. That is, iff every vertex has in degree= out degree.

[@rob6129]

94mathdude for an eulerian path one vertex can have in=out-1 and another out=in-1 and for the rest in=out

[@thelazybusycoder4861]

oomg mark zuk

[@bradgaragan4848]

Russ Cox vibes