Fig. 1
From: Alignment- and reference-free phylogenomics with colored de Bruijn graphs
Toy example for accumulating weights in a trie. The set of genomes \(\{a,b,c,d,e,f\}\) is considered as ordered list \(G=[a,b,c,d,e,f]\). a A table listing ordered splits extracted from a C-DBG and the corresponding representation as key and value to be stored in a trie. An ordered split can be observed several times with different weights, which are accumulated. A split and its inverse are represented in the trie by one key and a pair of weights. b Trie representing the splits. Keys correspond to concatenated edge lables along paths from the root to a labeled vertex. Values are shown in boxes. c Visualization of weakly compatible subset of splits. E.g., split \((\{a,b,f\},\{c,d,e\})\) of total weight \(\sqrt{9\cdot 12}\approx 10.4\) is visualized as three parallel lines. Split \((\{c,d\},\{a,b,e,f\})\) has the lowest total weight of \(\sqrt{25\cdot 5}\approx 10.2\), is the only split that is not weakly compatible to higher weighting splits and thus not contained in the network