Name
Abstract | ||
|---|---|---|
Computing the phylogenetic diversity of a set of species is an important part of many ecological case studies. More specifically, let (mathcal {T}) be a phylogenetic tree, and let R be a subset of its leaves representing the species under study. Specialists in ecology want to evaluate a function (f(mathcal {T},R)) (a phylogenetic measure) that quantifies the evolutionary distance between the elements in R. But, in most applications, it is also important to examine how (f(mathcal {T},R)) behaves when R is selected at random. The standard way to do this is to compute the mean and the variance of f among all subsets of leaves in (mathcal {T}) that consist of exactly (|R| = r) elements. For certain measures, there exist algorithms that can compute these statistics, under the condition that all subsets of r leaves are equiprobable. Yet, so far there are no algorithms that can do this exactly when the leaves in (mathcal {T}) are weighted with unequal probabilities. As a consequence, for this general setting, specialists try to compute the statistics of phylogenetic measures using methods which are both inexact and very slow. |
Year | Venue | Field |
|---|---|---|
2016 | RECOMB | Biodiversity,Ecology,Combinatorics,Phylogenetic tree,Path (graph theory),Phylogenetic diversity,Biology,Tree (data structure),Genetics,Computation |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
1 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Constantinos Tsirogiannis | 1 | 12 | 5.93 |
| Brody Sandel | 2 | 4 | 2.21 |