Figure 5From: MrsRF: an efficient MapReduce algorithm for analyzing large collections of evolutionary treesSequential running time and speedup of HashRF, HashRF( p , q ), and MrsRF (1 core) algorithms on 20,000 and 33,306 trees on 150 and 567 taxa, respectively. (a) denotes the running time for each algorithm. (b) denotes the speedup of HashRF(p, q) and MrsRF (1-core) over HashRF.Back to article page