Description Usage Arguments Details Value Author(s) References See Also Examples

View source: R/dist.multiPhylo.R

Computes the geodesic distance of a list of phylogenetic trees using a polynomial algorithm.

1 2 3 |

`x` |
A list of ape trees (class 'phylo'). The list does not have to be of class 'multiPhylo'. The function will also accept a list of strings of trees in Newick format, or a single string with trees in Newick format separated by semicolons. All the trees must have the same tip labels. |

`method` |
Determines which distance method is used. Options are 'geodesic' for the tree space geodesic distance, or 'edgeset' for the number of edges (defined by splits of tips) that are different. |

`force.multi2di` |
Force conversion of every tree to strict bifurcating through the ape function 'multi2di', using the use.random.resolution as its parameter. This option should not be used in conjunction with specification of an outgroup. |

`outgroup` |
Specifies an outgroup to root each tree with respect to. This calls the ape function 'root' on every tree in the list. |

`convert.multifurcating` |
Setting this option will check every tree for multifurcations using the ape function 'is.binary.tree' - if it returns FALSE, the ape function 'multi2di' will be called on it. Note that this does not ensure a tree is strictly binary, since ape considers an unrooted tree binary even if the root node is trifurcating. This option can be used in conjunction with specification of an outgroup. |

`use.random.resolution` |
Specifies the parameter to 'multi2di' if needed. |

`scale` |
Specifies a scale to make all trees unformly scaled (that is, the sum of
all edges will be uniform)scale to make all trees unformly scaled (that
is, the sum of all edge lengths will be uniform). The parameter can
either be a tree of class |

`verbose` |
Turns on incremental status updates and more warnings. Helpful for large computations. |

This function computes the geodesic distance according to Billera et. al. using an algorithm based off of the polynomial time algorithm of Owen and Provan. Since it corresponds to a formal definition of tree-space as a space of strictly binary trees, no mulifurcations are allowed, including on the root node. In addition, negative and 0-lengthed edges are clamped to a very small value (DBL_MIN) for technical reasons.

The Newick parser supports only a subset of the Newick format. In particular, it does not at the moment allow for internal node labels, only weights. Weights will be automatically set to 1 if not specified. It may be necessary to clean data in ape to make the trees conform to this.

Returns a distance matrix of class 'dist' representing the pairwise geodesic distances between all input trees. Keep in mind this distance matrix is not Euclidean. N/A values are provided in the case of an error in determining the distance.

John Chakerian <[email protected]>

Chakerian, J. and Holmes, S. P. Computational Tools for Evaluating Phylogenetic and Heirarchical Clustering Trees. arXiv:1006.1015v1.

Billera, L. J., Holmes, S. P., and Vogtmann, K. (2001) Geometry of the space of phylogenetic trees. _Adv. Appl. Math_, *27*, 733-767.

Megan Owen, J. Scott Provan, "A Fast Algorithm for Computing Geodesic Distances in Tree Space," IEEE/ACM Transactions on Computational Biology and Bioinformatics, 14 Jan. 2010.

1 2 3 4 5 6 7 8 9 10 11 12 13 | ```
data(woodmouse)
otree <- root(nj(dist.dna(woodmouse)), "No305", resolve.root=TRUE)
breps = 250
trees <- boot.phylo(otree, woodmouse, B=breps, function(x)
root(nj(dist.dna(x)), "No305", resolve.root=TRUE),trees=TRUE)
combined.trees <- c(list(otree), trees$trees)
tree.dists <- dist.multiPhylo(combined.trees)
mdres <- cmdscale(tree.dists, k=breps, add=TRUE)
plot(mdres$points[,1], mdres$points[,2], col = c("red", rep("black", breps)))
text(mdres$points[,1], mdres$points[,2], ,labels=1:(breps+1), cex=0.7, adj=c(0,2))
``` |

distory documentation built on May 29, 2017, 10:19 p.m.

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.