Skip to main content

Table 1 The complexity of algorithms

From: Recursive algorithms for phylogenetic tree counting

  No constraints
( k=1)
k constraints
sampling O(n) O(nk)
Serial sampling   
with no sampled O(m n) O(m2nk)
Serial sampling   
with sampled O(m n2)
  1. The table summaries the complexity of the counting algorithms, wheren is the sample size, k is the number of constraints, and m is the number of sampling time‐points. We assume that k is fixed.