Fig. 7
From: Fast parallel construction of variable-length Markov chains
Memory per input character for the construction of each algorithm. Results for the Pinus taeda are missing for Tree due to insufficient memory on the benchmark server. Overall, Cunial is superior to the other approaches