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 ?
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.
i can't believe my eyes, you are the author of bowtie! good job, i learned a lot from your code!
Thank you so much, and congratulations you did a great job explaining this!
Clear and welcoming videos, thank you!
The best explaination for De Brujin😃
shouldn't there be another self-directed edge for BB?
Excellent explanation. Thank you very much!
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 ?
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.
best explanation ever
you just saved my life!
Oh.....thank you so much!!!
Thanks, great explanation.
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.
Thank you!!
Wrong definition! Digraph is eulerian iff it has an eulerian cycle. That is, iff every vertex has in degree= out degree.
94mathdude for an eulerian path one vertex can have in=out-1 and another out=in-1 and for the rest in=out
Thanks!
Anyone else hearing Tumor?
oomg mark zuk
Russ Cox vibes