Fig. 6
From: Fast parallel construction of variable-length Markov chains
Speedup for the Tree and HashMap algorithms compared to Cunial. With parallellisation, the Tree and HashMap are up to 91 and 107 times faster than Cunial, respectively. Results for Pinus taeda are missing in some cases due to insufficient memory on the benchmarking machine, see text for details