Skip to main content
Figure 3 | Algorithms for Molecular Biology

Figure 3

From: Auto-validating von Neumann rejection sampling from small phylogenetic tree spaces

Figure 3

DAG expression for probability of the pattern xxx under a CFN star tree. The elementary function can be obtained from the terminus ⊙f10 of the recursion { ⊙ f i } i = 1 10 MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xH8viVGI8Gi=hEeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaGaei4EaSNaeSyMIuMaeCOzay2aaSbaaSqaaiabdMgaPbqabaGccqGG9bqFdaqhaaWcbaGaemyAaKMaeyypa0JaeGymaedabaGaeGymaeJaeGimaadaaaaa@38CC@ over the sub-expressions f1,...,f10 in the above directed acyclic graph (DAG) expression of l0(0t). Note that the leaf nodes are constants (s2, s5, s7 and s9) or variables (s1).

Back to article page