Skip to main content
Fig. 2 | Algorithms for Molecular Biology

Fig. 2

From: Implications of non-uniqueness in phylogenetic deconvolution of bulk DNA samples of tumors

Fig. 2

Example PPM instance F has three solutions. Frequency matrix F corresponds to a simulated \(n=5\) instance (#9) and has \(m=2\) samples. The ancestry graph \(G_F\) has six spanning arborescences. Among these, only trees \(T_1\), \(T_2\) and \(T_3\) satisfy the sum condition (SC), whereas trees \(T_4\), \(T_5\) and \(T_6\) violate (SC) leading to negative entries in \(U_4\), \(U_5\) and \(U_6\). Tree \(T_1\) is the simulated tree of this instance. Trees \(T_2\) and \(T_3\) differ from \(T_1\) by only one edge, and thus each have an edge recall of \(3/4 = 0.75\)

Back to article page