Fig. 2From: A maximum-likelihood approach for building cell-type trees by liftingExample of lifting leaf node A (L in the algorithm) in tree R. Tree R is divided into two smaller trees \({R_{L}^{1}}\) and \({R_{L}^{2}}\) as described in the algorithmBack to article page