For faster navigation, this Iframe is preloading the Wikiwand page for 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. For a set of m symbols S = {s1, …, sm}, the set of vertices is:

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 arcs (that is, directed edges) is

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

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.

Image showing multiple De Bruijn graphs, each the line graph of the previous one

Dynamical systems

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

Binary De Bruijn graph
Lorenz attractor

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

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.

Directed graphs of two B(2,3) de Bruijn sequences and a B(2,4) sequence. In B(2,3), each vertex is visited once, whereas in B(2,4), each edge is traversed once.

Embeddings resembling this one can be used to show that the binary De Bruijn graphs have queue number 2[6] and that they have book thickness at most 5.[7]

Uses

See also

References

  1. ^ de Bruijn, N. G. (1946). "A combinatorial problem". Indagationes Mathematicae. 49: 758–764. MR 0018142.
  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 des Mathématiciens. 1: 107–110.
  4. ^ Zhang, Fu Ji; Lin, Guo Ning (1987). "On the de Bruijn–Good graphs". Acta Mathematica Sinica. 30 (2): 195–205.
  5. ^ Leroux, Philippe (2005). "Coassociative grammar, periodic orbits, and quantum random walk over ". International Journal of Mathematics and Mathematical Sciences. 2005 (24): 3979–3996. arXiv:quant-ph/0209100. doi:10.1155/IJMMS.2005.3979. MR 2204471.
  6. ^ Heath, Lenwood S.; Rosenberg, Arnold L. (1992). "Laying out graphs using queues". SIAM Journal on Computing. 21 (5): 927–958. doi:10.1137/0221055. MR 1181408.
  7. ^ Obrenić, Bojana (1993). "Embedding de Bruijn and shuffle-exchange graphs in five pages". SIAM Journal on Discrete Mathematics. 6 (4): 642–654. doi:10.1137/0406049. MR 1241401.
  8. ^ Pevzner, Pavel A.; Tang, Haixu; Waterman, Michael S. (2001). "An Eulerian path approach to DNA fragment assembly". Proceedings of the National Academy of Sciences. 98 (17): 9748–9753. Bibcode:2001PNAS...98.9748P. doi:10.1073/pnas.171285098. PMC 55524. PMID 11504945.
  9. ^ Pevzner, Pavel A.; Tang, Haixu (2001). "Fragment Assembly with Double-Barreled Data". Bioinformatics. 17 (Suppl 1): S225–S233. doi:10.1093/bioinformatics/17.suppl_1.S225. PMID 11473013.
  10. ^ 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.
  11. ^ Chikhi, R.; Limasset, A.; Jackman, S.; Simpson, J.; Medvedev, P. (2014). "On the representation of de Bruijn graphs". Journal of Computational Biology. 22 (5): 336–52. arXiv:1401.5383. doi:10.1089/cmb.2014.0160. PMID 25629448. S2CID 9502231.
  12. ^ Iqbal, Zamin; Caccamo, Mario; Turner, Isaac; Flicek, Paul; McVean, Gil (2012). "De novo assembly and genotyping of variants using colored de Bruijn graphs". Nature Genetics. 44 (2): 226–32. doi:10.1038/ng.1028. PMC 3272472. PMID 22231483.
{{bottomLinkPreText}} {{bottomLinkText}}
De Bruijn graph
Listen to this article

This browser is not supported by Wikiwand :(
Wikiwand requires a browser with modern capabilities in order to provide you with the best reading experience.
Please download and use one of the following browsers:

This article was just edited, click to reload
This article has been deleted on Wikipedia (Why?)

Back to homepage

Please click Add in the dialog above
Please click Allow in the top-left corner,
then click Install Now in the dialog
Please click Open in the download dialog,
then click Install
Please click the "Downloads" icon in the Safari toolbar, open the first download in the list,
then click Install
{{::$root.activation.text}}

Install Wikiwand

Install on Chrome Install on Firefox
Don't forget to rate us

Tell your friends about Wikiwand!

Gmail Facebook Twitter Link

Enjoying Wikiwand?

Tell your friends and spread the love:
Share on Gmail Share on Facebook Share on Twitter Share on Buffer

Our magic isn't perfect

You can help our automatic cover photo selection by reporting an unsuitable photo.

This photo is visually disturbing This photo is not a good choice

Thank you for helping!


Your input will affect cover photo selection, along with input from other users.

X

Get ready for Wikiwand 2.0 🎉! the new version arrives on September 1st! Don't want to wait?