Skip to main content
. 2019 Dec 16;7:e8275. doi: 10.7717/peerj.8275

Figure 4. Simplified example of the n-grams BK-trees data structure.

Figure 4

If two edits are allowed, then each UMI is split into three non-overlapping n-grams. Each n-gram sequence and its interval position in the full UMI sequence corresponds to a BK-tree that contains all UMIs that the same n-gram sequence at the same position.