Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
The de Bruijn graph GK of a set of strings Sis a key data structure in genome assembly that represents overlaps between all the K… Expand
  • figure 1
  • table 1
Is this relevant?
2014
2014
The de Bruijn graph plays an important role in bioinformatics, especially in the context of de novo assembly. However, the… Expand
Is this relevant?
Highly Cited
2012
Highly Cited
2012
We propose a new succinct de Bruijn graph representation. If the de Bruijn graph of k-mers in a DNA sequence of length N has m… Expand
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… Expand
  • table 1
  • table 2
  • figure 1
  • figure 2
  • table 3
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Many organizations nowadays face the problem of accessing existing data sources by means of flexible mechanisms that are both… Expand
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Summary 1. In many European agricultural landscapes, species richness is declining considerably. Studies performed at a very… Expand
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
2000
Highly Cited
2000
In a series of papers, Petra Hendriks, Helen de Hoop, and Henriette de Swart Lave applied optimality theory (OT) to semantics… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Proposes de Bruijn graphs as logical topologies for multihop lightwave networks. After deriving bounds on the throughput and… Expand
  • figure 1
  • table I
  • figure 2
  • table II
  • figure 4
Is this relevant?
Highly Cited
1991
Highly Cited
1991
De Bruij n graphs provide a convenient way to describe configura tions of linear cellular automata (CAs). Using t hese gra phs… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1970
Highly Cited
1970
  • A. Lempel
  • IEEE Transactions on Computers
  • 1970
  • Corpus ID: 24622133
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… Expand
  • figure 1
  • figure 3
  • table I
Is this relevant?