Fig. 2
From: Evolution through segmental duplications and losses: a Super-Reconciliation approach
Time-efficiency of the algorithm with respect to the size of the ancestral synteny (for \(d = 5\)) and the depth of the input tree (for \(t = 5\)), for \(p_{dupl} = p_{loss} = p_{length} = 0.5\). Note that the leftmost graph uses a logarithmic scale