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

Fig. 4

From: A topology-marginal composite likelihood via a generalized phylogenetic pruning algorithm

Fig. 4

The setting for dynamic computation during the leafward pass. Assume \(A< B_1< B_2 < C\) in the lexicographic ordering. Here \(u = \{B_1, B_2\}\), \(s = \{B_1 \cup B_2, C\}\), and \(t = \{A, B_1 \cup B_2 \cup C\}\). We will use \(\tau ^{\uparrow }_{\grave{t}}\) to represent the partially-specified topology with all subsplits in clade A, t, and those towards the root from t. We will use \(\tau ^{\downarrow }_u\) to represent the topology leafward of u (including u itself)

Back to article page