Skip to main content
. 2014 Jul 4;63(5):798–811. doi: 10.1093/sysbio/syu044

Table 1.

Predictions for branch lengths of the ML tree using pairwise distances

Conditions Prediction
DBC ≥ DAB + DAC (incl. DBC = ∞) dA = 0
DAC ≥ DAB + DBC (incl. DAC = ∞) dB = 0
DAB ≥ DAC + DBC (incl. DAB = ∞) dC = 0
DAB = ∞ & DAC = ∞ dA = ∞
DAB = ∞ & DBC = ∞ dB = ∞
DAC = ∞ & DBC = ∞ dC = ∞
DAB = ∞ & DAC = ∞ & DBC = ∞ At least two of the branch lengths are infinite