Skip to main content

Questions tagged [de-bruijn-graphs]

Filter by
Sorted by
Tagged with
35 votes
2 answers
3k views

Why do some assemblers require an odd-length kmer for the construction of de Bruijn graphs?

Why do some assemblers like SOAPdenovo2 or Velvet require an odd-length k-mer size for the construction of de Bruijn graph, while some other assemblers like ABySS are fine with even-length k-mers?
Kamil S Jaron's user avatar
14 votes
3 answers
537 views

How to make a distinction between the "classical" de Bruijn graph and the one described in NGS papers?

In Computer Science a De Bruijn graph has (1) m^n vertices representing all possible sequences of length n over ...
Leo Martins's user avatar
10 votes
2 answers
290 views

Extract sequence context of high-degree nodes in assembly graphs

I often use metaSPAdes to assemble short reads from human microbiomes. My simplified understanding of short-read de Bruijn graph assemblers is that they fail where ambiguous paths cannot be resolved. ...
acvill's user avatar
  • 613
1 vote
0 answers
44 views

Where does the choice of k = 51 for de Bruijn graphs of large genomes come from?

This question has also been asked on Biostars From hearsay I know that de Bruijn graphs of large genomes (e.g. human) are usually constructed with k = 51, or that k = 51 is at least a good initial ...
Sebastian Schmidt's user avatar