Natural scienceBioinformaticsBioinformatics algorithmsAssembly

De Bruijn Graph

Is this the end

Report a typo

After we've connected all the k-mers together, what is the next step?

Select one option from the list

We have to double-check if there new suffixes or prefixes to merge

We have to find an Eulerian path first, then we can decide if the graph is ready

That's it, we've built the graph

___

Create a free account to access the full topic