Fast recovery of evolutionary trees with thousands of nodes

Journal of Computational Biology

Volumn 9, Issue 2, 2002, Pages 277-297

  Csurös, Miklós ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Distance based method; Evolutionary tree reconstruction; Harmonic greedy triplets; Phylogeny

Indexed keywords

ALGORITHM; CONFERENCE PAPER; DNA SEQUENCE; PHYLOGENETIC TREE; PHYLOGENETIC TREE CONSTRUCTION METHOD; PRIORITY JOURNAL; PROBABILITY; SAMPLE SIZE; SIMULATION; THEORY;

ALGORITHMS; BASE SEQUENCE; COMPUTATIONAL BIOLOGY; DNA; EVOLUTION, MOLECULAR; MARKOV CHAINS; MODELS, GENETIC; PHYLOGENY;

EID: 0036108575     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/10665270252935467     Document Type: Conference Paper

References (37)

1. The performance of neighbor-joining methods of phylogeny reconstruction
2. Reconstructing the shape of a tree from observed dissimilarity data
3. Deep Green rewrites evolutionary history of plants
4. Weighted neighbor-joining: A likelihood-based approach to distance-based phylogeny reconstruction
5. The recovery of trees from dissimilarity matrices
6. Phylogenetics of seed plants: An analysis of nucleotide sequences from the plastid gene rbcL
7. Evolutionary trees can be learned in polynomial time in the two-state general Markov model
8. Provably fast and accurate recovery of evolutionary trees through Harmonic Greedy Triplets
9. A few logs suffice to build (almost) all trees (I)
10. A few logs suffice to build (almost) all trees (II)
11. Efficient algorithms for inverting evolution
12. Cases in which parsimony or compatibility methods will be positively misleading
13. BIONJ: An improved version of the NJ algorithm based on a simple model of sequence data
14. Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time
15. Probability inequalities for sums of bounded random variables
16. Disk-Covering, a fast-converging method for phylogenetic tree reconstruction
17. Evolution of protein molecules
18. Large-scale phylogenies and measuring the performance of phylogenetic estimators
19. Estimation of evolutionary differences between homologous nucleotide sequences
20. Reconstructing evolutionary trees from DNA and protein sequences: Paralinear distances
21. A new method for calculating evolutionary substitution rates
22. Recovering evolutionary trees under a more realistic model of sequence evolution
23. The RDP (Ribosomal Database Project) continues
24. On the method of bounded differences
25. Molecular studies of evolution: A source of novel statistical problems
26. Taxon sampling and the accuracy of large phylogenies
27. Parsimony is hard to beat!
28. Comparison of phylogenetic trees
29. The neighbor-joining method: A new method for reconstructing phylogenetic trees
30. Recovering a tree from the leaf colourations it generates under a Markov model
31. A note on the neighbor-joining method of Saitou and Nei
32. Some probabilistic and statistical problems in the analysis of DNA sequences
33. Absolute convergence: True trees from short sequences
34. Additive evolutionary trees