Skip to main content


Fig. 8 | Algorithms for Molecular Biology

Fig. 8

From: Prefix-free parsing for building big BWTs

Fig. 8

Computational efficiency of the three stages of index building when SA sampling is included. Results are shown for the prefix-free parsing (“pfbwt”), back-stepping (“bwtscan”) and run-length encoding (“rle”) steps. “total” is the sum of the three steps

Back to article page