Name
Abstract | ||
|---|---|---|
Understanding the evolution of a set of genes or species is a fundamental problem in evolutionary biology. The problem we study here takes as input a set of trees describing possibly discordant evolutionary scenarios for a given set of genes or species, and aims at finding a single tree that minimizes the leaf-removal distance to the input trees. This problem is a specific instance of the general consensus/super-tree problem, widely used to combine or summarize discordant evolutionary trees. The problem we introduce is specifically tailored to address the case of discrepancies between the input trees due to the misplacement of individual taxa. Most supertree or consensus tree problems are computationally intractable, and we show that the problem we introduce is also NP-hard. We provide tractability results in form of a 2-approximation algorithm and a parameterized algorithm with respect to the number of removed leaves. We also introduce a variant that minimizes the maximum number d of leaves that are removed from any input tree, and provide a parameterized algorithm for this problem with parameter d. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-319-67428-5_12 | Lecture Notes in Computer Science |
Keywords | DocType | Volume |
Computational biology,Phylogenetics,Parameterized algorithms,Approximation,Consensus trees,Leaf deletion | Journal | 10508 |
Issue | ISSN | Citations |
10508 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| cedric chauve | 1 | 429 | 41.81 |
| Mark Jones | 2 | 1 | 0.72 |
| Manuel Lafond | 3 | 68 | 12.09 |
| Celine Scornavacca | 4 | 216 | 18.80 |
| Mathias Weller | 5 | 138 | 14.17 |