De Bruijn graph

De Bruijn graph

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 vertices, consisting of all possible length-n sequences of the given symbols; the same symbol may appear multiple times in a sequence. If we have the set of m symbols S:=\{s_1,\dots,s_m\} then the set of vertices is:

V=S^n=\{(s_1,\dots,s_1,s_1),(s_1,\dots,s_1,s_2),\dots,(s_1,\dots,s_1,s_m),(s_1,\dots,s_2,s_1),\dots,(s_m,\dots,s_m,s_m)\}.

If one of the vertices can be expressed as another vertex by shifting all its symbols by one place to the left and adding a new symbol at the end of this vertex, then the latter has a directed edge to the former vertex. Thus the set of (directed) edges is

E=\{((v_1,v_2,\dots,v_n),(w_1,w_2,\dots,w_n)) : v_2=w_1,v_3=w_2,\dots,v_n=w_{n-1}\}.

Although De Bruijn graphs are named after Nicolaas Govert de Bruijn, they were discovered independently by both De Bruijn[1] and I. J. Good [2]. Much earlier, Flye Sainte-Marie[3] implicitly used their properties.

Contents

Properties

  • If n = 1 then the condition for any two vertices forming an edge holds vacuously, and hence all the vertices are connected forming a total of m2 edges.
  • Each vertex has exactly m incoming and m outgoing edges.
  • Each n-dimensional De Bruijn graph is the line digraph of the (n − 1)-dimensional De Bruijn graph with the same set of symbols [4].
  • Each De Bruijn graph is Eulerian and Hamiltonian. The Euler cycles and Hamiltonian cycles of these graphs (equivalent to each other via the line graph construction) are De Bruijn sequences.

The line graph construction of the three smallest binary De Bruijn graphs is depicted below. As can be seen in the illustration, each vertex of the n-dimensional De Bruijn graph corresponds to an edge of the (n − 1)-dimensional De Bruijn graph, and each edge in the n-dimensional De Bruijn graph corresponds to a two-edge path in the (n − 1)-dimensional De Bruijn graph.

DeBruijn-as-line-digraph.svg

Dynamical systems

Binary De Bruijn graphs can be drawn (below, left) in such a way that they resemble objects from the theory of dynamical systems, such as the Lorenz attractor (below, right):

DeBruijn-3-2.svg         Lorenz attractor yb.svg

This analogy can be made rigorous: the n-dimensional m-symbol De Bruijn graph is a model of the Bernoulli map

x\mapsto mx\ \bmod\ 1

The Bernoulli map (also called the 2x mod 1 map for m = 2) is an ergodic dynamical system, which can be understood to be a single shift of a m-adic number [5]. The trajectories of this dynamical system correspond to walks in the De Bruijn graph, where the correspondence is given by mapping each real x in the interval [0,1) to the vertex corresponding to the first n digits in the base-m representation of x. Equivalently, walks in the De Bruijn graph correspond to trajectories in a one-sided subshift of finite type.

Uses

See also

References

  1. ^ de Bruijn, N. G. (1946). "A Combinatorial Problem". Koninklijke Nederlandse Akademie v. Wetenschappen 49: 758–764. 
  2. ^ Good, I. J. (1946). "Normal recurring decimals". Journal of the London Mathematical Society 21 (3): 167–169. doi:10.1112/jlms/s1-21.3.167. 
  3. ^ Flye Sainte-Marie, C. (1894). "Question 48". L'Intermédiaire Math. 1: 107–110. 
  4. ^ Zhang, Fu Ji; Lin, Guo Ning (1987). "On the de Bruijn-Good graphs". Acta Math. Sinica 30 (2): 195–205. 
  5. ^ Leroux, Philippe (2002), Coassociative grammar, periodic orbits and quantum random walk over Z, arXiv:quant-ph/0209100, Bibcode 2002quant.ph..9100P 
  6. ^ Pevzner, Pavel A.; Tang, Haixu; Waterman, Michael S. (2001). "An Eulerian path approach to DNA fragment assembly". PNAS 98 (17): 9748–9753. Bibcode 2001PNAS...98.9748P. doi:10.1073/pnas.171285098. PMC 55524. PMID 11504945. http://www.pubmedcentral.nih.gov/articlerender.fcgi?tool=pmcentrez&artid=55524. 
  7. ^ Pevzner, Pavel A.; Tang, Haixu (2001). "Fragment Assembly with Double-Barreled Data". Bioinformatics/ISMB 1: 1–9. 
  8. ^ Zerbino, Daniel R.; Birney, Ewan (2008). "Velvet: algorithms for de novo short read assembly using de Bruijn graphs". Genome Research 18 (5): 821–829. doi:10.1101/gr.074492.107. PMC 2336801. PMID 18349386. http://www.pubmedcentral.nih.gov/articlerender.fcgi?tool=pmcentrez&artid=2336801. 

Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать реферат

Look at other dictionaries:

  • Bruijn — may refer to;* Chantal de Bruijn Dutch field hockey player. * Cornelis de Bruijn‎ (1652 1727) a Dutch artist and traveler. * Inge de Bruijn a former Dutch swimmer. * Nicolaas Govert de Bruijn a Dutch mathematician. * Pi de Bruijn a Dutch… …   Wikipedia

  • Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… …   Wikipedia

  • Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and …   Wikipedia

  • De Bruijn sequence — A diagram showing the De Bruijn sequence where k=2 and n=2 In combinatorial mathematics, a k ary De Bruijn sequence B(k, n) of order n, named after the Dutch mathematician Nicolaas Govert de Bruijn, is a cyclic sequence of a given alphabet A …   Wikipedia

  • Nicolaas Govert de Bruijn — Born 9 July 1918 (1918 07 09) (age 93) …   Wikipedia

  • Claw-free graph — A claw In graph theory, an area of mathematics, a claw free graph is a graph that does not have a claw as an induced subgraph. A claw is another name for the complete bipartite graph K1,3 (that is, a star graph with three edges, three leaves, and …   Wikipedia

  • De Bruijn — is a Dutch surname. It may refer to: Chantal de Bruijn Cornelis de Bruijn, Dutch artist and traveler Daniëlle de Bruijn Inge de Bruijn, Dutch swimmer Nicolaas Govert de Bruijn, Dutch mathematician Maarten de Bruijn Nick de Bruijn Pi de Bruijn In… …   Wikipedia

  • List of graph theory topics — This is a list of graph theory topics, by Wikipedia page. See glossary of graph theory for basic terminology Contents 1 Examples and types of graphs 2 Graph coloring 3 Paths and cycles 4 …   Wikipedia

  • Kautz graph — Sample of K. graph with M=2: on the left N=1, on the right N=2.The edges of the left graph correspond to the nodes of right graph.The Kautz graph K M^{N + 1} is a directed graph of degree M and dimension N+1, which has (M +1)M^{N} vertices… …   Wikipedia

  • De Bruijn–Erdős theorem (graph theory) — This article is about coloring infinite graphs. For the number of lines determined by a finite set of points, see De Bruijn–Erdős theorem (incidence geometry). In graph theory, the De Bruijn–Erdős theorem, proved by Nicolaas Govert de Bruijn and… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”