Tree Estimation Based on the Minimum Evolution Algorithm
The two FastME functions (balanced and OLS) perform the minimum evolution algorithm of Desper and Gascuel (2002).
fastme.bal(X, nni = TRUE, spr = TRUE, tbr = FALSE) fastme.ols(X, nni = TRUE)
X |
a distance matrix; may be an object of class |
nni |
a logical value; TRUE to perform NNIs (default). |
spr |
ditto for SPRs. |
tbr |
ignored (see details). |
The code to perform topology searches based on TBR (tree bisection and
reconnection) did not run correctly and has been removed after the
release of ape 5.3. A warning is issued if tbr = TRUE
.
an object of class "phylo"
.
original C code by Richard Desper; adapted and ported to R by Vincent Lefort vincent.lefort@lirmm.fr
Desper, R. and Gascuel, O. (2002) Fast and accurate phylogeny reconstruction algorithms based on the minimum-evolution principle. Journal of Computational Biology, 9, 687–705.
### From Saitou and Nei (1987, Table 1): x <- c(7, 8, 11, 13, 16, 13, 17, 5, 8, 10, 13, 10, 14, 5, 7, 10, 7, 11, 8, 11, 8, 12, 5, 6, 10, 9, 13, 8) M <- matrix(0, 8, 8) M[lower.tri(M)] <- x M <- t(M) M[lower.tri(M)] <- x dimnames(M) <- list(1:8, 1:8) tr <- fastme.bal(M) plot(tr, "u") ### a less theoretical example data(woodmouse) trw <- fastme.bal(dist.dna(woodmouse)) plot(trw)
Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.