For the purposes of this work, however, we focus on finding the convergence method that gets closest to a median coverage of 50% while maximizing speedup. We thus chose the method that uses a minimum Spearman coefficient of 0.8 with 50 consecutive convergence generations, which has a median coverage of 42%. Although it performed very similarly to the convergence method using a minimum Spearman coefficient of 0.7 with 50 consecutive convergence generations, we selected the former method as its coverage distribution skewed slightly higher than the latter method.