Skip to main content

Advertisement

Figure 7 | Algorithms for Molecular Biology

Figure 7

From: Recursive algorithms for phylogenetic tree counting

Figure 7

Location of a new node between the (p−1)‐th andp‐th time points. A new node can be placed in subtreec between the (p−1)‐th andp‐th time points if the number of green branches is greater or equal to 2 and the number of all branches in subtreec is greater than 2.

Back to article page