Algorithm 2. Greedy Strict Consensus Merger.

1:	function pickOptimalTreePair (trees $\mathcal{S}\subseteq \left\{T_1,T_2,\dots ,T_k\right\}$)
2:	Pick two trees $\left\{T_i,T_j\right\}\subseteq \mathcal{S}$ which maximize score(Ti, Tj)
3:	return Ti, Tj
4:	end function
1:	function gscm (trees {T1, T2, …, Tk})
2:	$\mathcal{S}\leftarrow \left\{T_1,T_2,\dots ,T_k\right\}$
3:	while $\left|\mathcal{S}\right|\ge 2$ do
4:	Ti, Tj←pickOptimalTreePair$\left(\mathcal{S}\right)$
5:	$\mathcal{S}\leftarrow \mathcal{S}\setminus \left\{T_i,T_j\right\}$
6:	Tscm← SCM(Ti, Tj)
7:	$\mathcal{S}\leftarrow \mathcal{S}\cup \left\{T_{scm}\right\}$
8:	end while
9:	return Tscm
10:	end function