Reconstructing the shape of a tree from observed dissimilarity data
Advances in Applied Mathematics
A few logs suffice to build (almost) all trees: part II
Theoretical Computer Science
A few logs suffice to build (almost) all trees (l): part I
Random Structures & Algorithms
Provably Fast and Accurate Recovery of Evolutionary Trees through Harmonic Greedy Triplets
SIAM Journal on Computing
SIAM Journal on Discrete Mathematics
On the complexity of distance-based evolutionary tree reconstruction
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A Short Proof that Phylogenetic Tree Reconstruction by Maximum Likelihood Is Hard
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Optimal phylogenetic reconstruction
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Finding a maximum likelihood tree is hard
Journal of the ACM (JACM)
Distorted Metrics on Trees and Phylogenetic Forests
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Fast and reliable reconstruction of phylogenetic trees with very short edges
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Maximal accurate forests from distance matrices
RECOMB'06 Proceedings of the 10th annual international conference on Research in Computational Molecular Biology
Network delay inference from additive metrics
Random Structures & Algorithms
Fast error-tolerant quartet phylogeny algorithms
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Towards a practical O(n log n) phylogeny algorithm
WABI'11 Proceedings of the 11th international conference on Algorithms in bioinformatics
Alignment-Free phylogenetic reconstruction
RECOMB'10 Proceedings of the 14th Annual international conference on Research in Computational Molecular Biology
Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges
Random Structures & Algorithms
Fast phylogenetic tree reconstruction using locality-sensitive hashing
WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
Fast error-tolerant quartet phylogeny algorithms
Theoretical Computer Science
Hi-index | 0.00 |
We introduce a new phylogenetic reconstruction algorithm which, unlike most previous rigorous inference techniques, does not rely on assumptions regarding the branch lengths or the depth of the tree. The algorithm returns a forest which is guaranteed to contain all edges that are: 1) sufficiently long and 2) sufficiently close to the leaves. How much of the true tree is recovered depends on the sequence length provided. The algorithm is distance-based and runs in polynomial time.