LATENT REFERENCES / TAG2
De Bruijn Graph
Original title: De Bruijn graph (De Bruijnグラフ)
This reference note belongs to Tag2 in Latent References, an archive curated by Keigo Yoshida. Its archive region is Physics. The note preserves its source text and links so that readers can trace the material behind the 3D map.
- Collection
- Tag2
- Archive region
- Physics
Archived reference note
English translation of the archived note. JP shows the original text. Source links and literal code are retained; the translation does not update or independently verify the source claims.
de Bruijn graphs are used when determining organisms' DNA sequences.
In graph theory, an n-dimensional De Bruijn graph of m symbols is a directed graph representing overlaps between sequences of symbols. It has mⁿ vertices, consisting of all possible length-n sequences of the given symbols; the same symbol may appear multiple times in a sequence.
https://scrapbox.io/files/64a55dc294ee79001c9c8281.png
de Bruijnグラフは生物のDNA配列を決定する際に用いられる。
In graph theory, an n-dimensional De Bruijn graph of m symbols is a directed graph representing overlaps between sequences of symbols. It has mⁿ vertices, consisting of all possible length-n sequences of the given symbols; the same symbol may appear multiple times in a sequence.
https://scrapbox.io/files/64a55dc294ee79001c9c8281.png
Source updated 2023-07-05 · Snapshot 2026-10-08
Source links and calculated neighbors
Cosine values measure shared lexical features, not truth, agreement or identical meaning. Original reference links are labeled separately.
- Graph TheoryComputed lexical cosine similarity 0.176 · shared title, text, tags and references
- GraphiteComputed lexical cosine similarity 0.124 · shared title, text, tags and references
- LithographComputed lexical cosine similarity 0.113 · shared title, text, tags and references