de Bruijn graph
E239167
A de Bruijn graph is a directed graph structure that compactly represents overlaps between sequences of symbols, widely used in combinatorics, coding theory, and genome assembly algorithms.
All labels observed (2)
| Label | Occurrences |
|---|---|
| de Bruijn graph canonical | 3 |
| de Bruijn graphs | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T2169627 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: de Bruijn graph Context triple: [N. G. de Bruijn, notableWork, de Bruijn graph]
-
A.
DAG
DAG is the National Rail station code for Dalgety Bay railway station in Fife, Scotland.
-
B.
Dijkstra
Dijkstra is a renowned Dutch computer scientist best known for his pioneering work in algorithms, including Dijkstra's shortest path algorithm, and for his influential contributions to programming methodology and software engineering.
-
C.
BRIN
BRIN (Block Range Index) is a lightweight PostgreSQL index type optimized for very large tables by summarizing ranges of physical data blocks instead of indexing every individual row.
-
D.
Levenstein
Levenstein is a surname, often a variant of Löwenstein, borne by individuals of German or Ashkenazi Jewish origin.
-
E.
DGL
DGL is the vehicle registration code assigned to the town of Głogów in Poland.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: de Bruijn graph Target entity description: A de Bruijn graph is a directed graph structure that compactly represents overlaps between sequences of symbols, widely used in combinatorics, coding theory, and genome assembly algorithms.
-
A.
DAG
DAG is the National Rail station code for Dalgety Bay railway station in Fife, Scotland.
-
B.
Dijkstra
Dijkstra is a renowned Dutch computer scientist best known for his pioneering work in algorithms, including Dijkstra's shortest path algorithm, and for his influential contributions to programming methodology and software engineering.
-
C.
BRIN
BRIN (Block Range Index) is a lightweight PostgreSQL index type optimized for very large tables by summarizing ranges of physical data blocks instead of indexing every individual row.
-
D.
Levenstein
Levenstein is a surname, often a variant of Löwenstein, borne by individuals of German or Ashkenazi Jewish origin.
-
E.
DGL
DGL is the vehicle registration code assigned to the town of Głogów in Poland.
- F. None of above. chosen
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf |
combinatorial structure
ⓘ
directed graph ⓘ mathematical concept ⓘ |
| advantage |
enables linear-time traversal for assembly under ideal conditions
ⓘ
memory-efficient representation of sequence overlaps ⓘ |
| alphabet | finite alphabet of symbols ⓘ |
| applicationDomain |
metagenomic assembly
ⓘ
next-generation sequencing ⓘ short-read assembly ⓘ |
| challenge |
graph simplification and compaction
ⓘ
handling sequencing errors ⓘ resolving repeats ⓘ |
| coloredVariantUsedFor | representing multiple genomes or samples ⓘ |
| commonAlgorithmicUse | finding Eulerian paths to reconstruct sequences ⓘ |
| compactedVariantUsedFor | reducing number of vertices and edges ⓘ |
| edgeDirectionMeaning | extension of a (k−1)-mer by one symbol ⓘ |
| field |
bioinformatics
ⓘ
coding theory ⓘ combinatorics ⓘ genome assembly ⓘ graph theory ⓘ |
| hasProperty |
can be very large for genomic data
ⓘ
compact representation of overlaps ⓘ directed ⓘ edges represent overlaps ⓘ often constructed from k-mers ⓘ supports Eulerian path traversal ⓘ vertices represent substrings ⓘ |
| hasVariant |
colored de Bruijn graph
ⓘ
compacted de Bruijn graph ⓘ weighted de Bruijn graph ⓘ |
| historicalContext | introduced in the study of de Bruijn sequences ⓘ |
| namedAfter |
N. G. de Bruijn
ⓘ
surface form:
Nicolaas Govert de Bruijn
|
| relatedTo |
Eulerian path
ⓘ
assembly graph ⓘ de Bruijn sequence ⓘ k-mer ⓘ overlap graph ⓘ string graph ⓘ |
| typicalEdgeDefinition | k-mer whose prefix and suffix are vertices ⓘ |
| typicalVertexDefinition | (k−1)-mer over a given alphabet ⓘ |
| usedFor |
design of de Bruijn sequences
ⓘ
error correction in sequencing data ⓘ genome assembly algorithms ⓘ modeling k-mer overlaps ⓘ representing overlaps between sequences of symbols ⓘ sequence assembly ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: de Bruijn graph Description of subject: A de Bruijn graph is a directed graph structure that compactly represents overlaps between sequences of symbols, widely used in combinatorics, coding theory, and genome assembly algorithms.
Referenced by (4)
Full triples — surface form annotated when it differs from this entity's canonical label.
this entity surface form:
de Bruijn graphs