148 related articles for article (PubMed ID: 19179704)
1. Consistency of topological moves based on the balanced minimum evolution principle of phylogenetic inference.
Bordewich M; Gascuel O; Huber KT; Moulton V
IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(1):110-7. PubMed ID: 19179704
[TBL] [Abstract][Full Text] [Related]
2. Theoretical foundation of the balanced minimum evolution method of phylogenetic inference and its relationship to weighted least-squares tree fitting.
Desper R; Gascuel O
Mol Biol Evol; 2004 Mar; 21(3):587-98. PubMed ID: 14694080
[TBL] [Abstract][Full Text] [Related]
3. Fast and accurate phylogeny reconstruction algorithms based on the minimum-evolution principle.
Desper R; Gascuel O
J Comput Biol; 2002; 9(5):687-705. PubMed ID: 12487758
[TBL] [Abstract][Full Text] [Related]
4. constNJ: an algorithm to reconstruct sets of phylogenetic trees satisfying pairwise topological constraints.
Matsen FA
J Comput Biol; 2010 Jun; 17(6):799-818. PubMed ID: 20500096
[TBL] [Abstract][Full Text] [Related]
5. Robustness of phylogenetic inference based on minimum evolution.
Pardi F; Guillemot S; Gascuel O
Bull Math Biol; 2010 Oct; 72(7):1820-39. PubMed ID: 20449671
[TBL] [Abstract][Full Text] [Related]
6. The prevalence of multifurcations in tree-space and their implications for tree-search.
Whelan S; Money D
Mol Biol Evol; 2010 Dec; 27(12):2674-7. PubMed ID: 20584772
[TBL] [Abstract][Full Text] [Related]
7. Efficiencies of fast algorithms of phylogenetic inference under the criteria of maximum parsimony, minimum evolution, and maximum likelihood when a large number of sequences are used.
Takahashi K; Nei M
Mol Biol Evol; 2000 Aug; 17(8):1251-8. PubMed ID: 10908645
[TBL] [Abstract][Full Text] [Related]
8. Shortest triplet clustering: reconstructing large phylogenies using representative sets.
Vinh le S; von Haeseler A
BMC Bioinformatics; 2005 Apr; 6():92. PubMed ID: 15819989
[TBL] [Abstract][Full Text] [Related]
9. A practical method for exact computation of subtree prune and regraft distance.
Wu Y
Bioinformatics; 2009 Jan; 25(2):190-6. PubMed ID: 19019848
[TBL] [Abstract][Full Text] [Related]
10. Maximum similarity: a new formulation of phylogenetic reconstruction.
Huang X; Vingron M
J Comput Biol; 2009 Jul; 16(7):887-96. PubMed ID: 19580518
[TBL] [Abstract][Full Text] [Related]
11. A fast algorithm for computing geodesic distances in tree space.
Owen M; Provan JS
IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(1):2-13. PubMed ID: 21071792
[TBL] [Abstract][Full Text] [Related]
12. A topological transformation in evolutionary tree search methods based on maximum likelihood combining p-ECR and neighbor joining.
Guo MZ; Li JF; Liu Y
BMC Bioinformatics; 2008 May; 9 Suppl 6(Suppl 6):S4. PubMed ID: 18541057
[TBL] [Abstract][Full Text] [Related]
13. Approximating subtree distances between phylogenies.
Bonet ML; St John K; Mahindru R; Amenta N
J Comput Biol; 2006 Oct; 13(8):1419-34. PubMed ID: 17061919
[TBL] [Abstract][Full Text] [Related]
14. Improving the efficiency of SPR moves in phylogenetic tree search methods based on maximum likelihood.
Hordijk W; Gascuel O
Bioinformatics; 2005 Dec; 21(24):4338-47. PubMed ID: 16234323
[TBL] [Abstract][Full Text] [Related]
15. An evolution strategy approach for the balanced minimum evolution problem.
Gasparin A; Camerota Verdù FJ; Catanzaro D; Castelli L
Bioinformatics; 2023 Nov; 39(11):. PubMed ID: 37889263
[TBL] [Abstract][Full Text] [Related]
16. An efficient algorithm for approximating geodesic distances in tree space.
Battagliero S; Puglia G; Vicario S; Rubino F; Scioscia G; Leo P
IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(5):1196-207. PubMed ID: 21116041
[TBL] [Abstract][Full Text] [Related]
17. Minimum-flip supertrees: complexity and algorithms.
Chen D; Eulenstein O; Fernandez-Baca D; Sanderson M
IEEE/ACM Trans Comput Biol Bioinform; 2006; 3(2):165-73. PubMed ID: 17048402
[TBL] [Abstract][Full Text] [Related]
18. Getting a tree fast: Neighbor Joining, FastME, and distance-based methods.
Desper R; Gascuel O
Curr Protoc Bioinformatics; 2006 Oct; Chapter 6():Unit 6.3. PubMed ID: 18428768
[TBL] [Abstract][Full Text] [Related]
19. A rapid heuristic algorithm for finding minimum evolution trees.
Rodin A; Li WH
Mol Phylogenet Evol; 2000 Aug; 16(2):173-9. PubMed ID: 10942605
[TBL] [Abstract][Full Text] [Related]
20. A computer simulation analysis of the accuracy of partial genome sequencing and restriction fragment analysis in the reconstruction of phylogenetic relationships.
Qiao B; Goldberg TL; Olsen GJ; Weigel RM
Infect Genet Evol; 2006 Jul; 6(4):323-30. PubMed ID: 16406823
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]