Name
Abstract | ||
|---|---|---|
Given trees and * on the same taxon set, the (*) is the number of taxa that need to be ignored so that the bipartition induced by branch in is equal to some bipartition in *. Recently, Lemoine . [] used the transfer index to design a novel bootstrap analysis technique that improves on Felsenstein’s bootstrap on large, noisy data sets. In this work, we propose an algorithm that computes the transfer index for all branches in ( log ) time, which improves upon the current ()-time algorithm by Lin, Rajan and Moret []. Our implementation is able to process pairs of trees with hundreds of thousands of taxa in minutes and considerably speeds up the method of Lemoine . on large data sets. We believe our algorithm can be useful for comparing large phylogenies, especially when some taxa are misplaced (e.g. due to horizontal gene transfer, recombination, or reconstruction errors). |
Year | DOI | Venue |
|---|---|---|
2019 | 10.4230/LIPIcs.WABI.2019.20 | WABI |
Field | DocType | Citations |
Combinatorics,Phylogenetic tree,Computer science,Computational biology | Conference | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jakub Truszkowski | 1 | 50 | 6.44 |
| Olivier Gascuel | 2 | 433 | 76.01 |
| Krister M. Swenson | 3 | 0 | 0.34 |