De Bruijn graph
Summary
In graph theory, an -dimensional De Bruijn graph of symbols is a directed graph representing overlaps between sequences of symbols. It has vertices, consisting of all possible length- sequences of the given symbols; the same symbol may appear multiple times in a sequence. For a set of symbols the set of vertices is:
Further reading
- Wikipedia, page 2346823, revision 1368876410, De Bruijn graph. adopted
About this page
| Tag | T2W58MMTWB |
|---|---|
| URI | m2://T2W58MMTWB |
| Aliases | de-bruijn-diagram, de-bruijn-digraph |
| Kind | concept |
| Writing | W1 stated |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.