Computing the Skewness of the Phylogenetic Mean Pairwise Distance in Linear Time

Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisTidsskriftartikelForskningpeer review

The phylogenetic Mean Pairwise Distance (MPD) is one of the most popular measures for computing the phylogenetic distance between a given group of species. More specifically, for a phylogenetic tree and for a set of species R represented by a subset of the leaf nodes of , the MPD of R is equal to the average cost of all possible simple paths in that connect pairs of nodes in R.

Among other phylogenetic measures, the MPD is used as a tool for deciding if the species of a given group R are closely related. To do this, it is important to compute not only the value of the MPD for this group but also the expectation, the variance, and the skewness of this metric. Although efficient algorithms have been developed for computing the expectation and the variance the MPD, there has been no approach so far for computing the skewness of this measure.
TidsskriftAlgorithms for Molecular Biology
Antal sider16
StatusUdgivet - 2014

Bibliografisk note

Expanded version of one of the best papers from the 13th International Workshop, WABI 2013

Se relationer på Aarhus Universitet Citationsformater

ID: 84647691