De Bruijn graph

Known as: De Bruijn digraph, De Bruijn, De Bruijn diagram 
In graph theory, an n-dimensional De Bruijn graph of m symbols is a directed graph representing overlaps between sequences of symbols. It has mn… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
We prove optimal upper bound on the cutwidîh of the gênerai de Bruijn graph. Our upper bound is essentially based on a new… (More)
  • figure 1
Is this relevant?
2016
2016
Next Generation Sequencing (NGS) has dramatically enhanced our ability to sequence genomes, but not to assemble them. In practice… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2015
Highly Cited
2015
MEGAHIT is a NGS de novo assembler for assembling large and complex metagenomics data in a time- and cost-efficient manner. It… (More)
  • table 1
  • figure 1
  • table 2
  • table 3
Is this relevant?
2014
2014
Genome assembly is usually abstracted as the problem of reconstructing a string from a set of its k-mers. This abstraction… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2014
2014
New technologies have tremendously increased sequencing throughput compared to traditional techniques, thereby complicating DNA… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2012
2012
Massively parallel DNA sequencing technologies are revolutionizing genomics research. Billions of short reads generated at low… (More)
  • figure 1
  • figure 2
  • figure 5
  • figure 7
  • figure 6
Is this relevant?
Highly Cited
2011
Highly Cited
2011
T development of algorithmic ideas for next-generation sequencing can be traced back 300 years to the Prussian city of Königsberg… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2010
Highly Cited
2010
The de Bruijn graph assembly approach breaks reads into k-mers before assembling them into contigs. The string graph approach… (More)
  • table 1
  • table 2
  • figure 1
  • figure 2
  • table 3
Is this relevant?
Highly Cited
1994
Highly Cited
1994
AbsfmcfWe propose de Bruijn graphs as logical topologies for multihop lightwave networks. After deriving bounds on the throughput… (More)
  • figure 1
  • table I
  • figure 2
  • table II
  • figure 4
Is this relevant?
Highly Cited
1970
Highly Cited
1970
A homomorphism of the de Bruijn graph that maps a graph of order n onto one of order n-1 and its applications to the design of… (More)
  • figure 1
  • figure 3
  • table I
Is this relevant?