158 related articles for article (PubMed ID: 27155875)
21. The behavior of admixed populations in neighbor-joining inference of population trees.
Kopelman NM; Stone L; Gascuel O; Rosenberg NA
Pac Symp Biocomput; 2013; ():273-84. PubMed ID: 23424132
[TBL] [Abstract][Full Text] [Related]
22. 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]
23. Probabilistic Distances Between Trees.
Garba MK; Nye TMW; Boys RJ
Syst Biol; 2018 Mar; 67(2):320-327. PubMed ID: 29029295
[TBL] [Abstract][Full Text] [Related]
24. 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]
25. 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]
26. On the fixed parameter tractability of agreement-based phylogenetic distances.
Bordewich M; Scornavacca C; Tokac N; Weller M
J Math Biol; 2017 Jan; 74(1-2):239-257. PubMed ID: 27221239
[TBL] [Abstract][Full Text] [Related]
27. NJML: a hybrid algorithm for the neighbor-joining and maximum-likelihood methods.
Ota S; Li WH
Mol Biol Evol; 2000 Sep; 17(9):1401-9. PubMed ID: 10958856
[TBL] [Abstract][Full Text] [Related]
28. 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]
29. Missing the forest for the trees: phylogenetic compression and its implications for inferring complex evolutionary histories.
Ané C; Sanderson M
Syst Biol; 2005 Feb; 54(1):146-57. PubMed ID: 15805016
[TBL] [Abstract][Full Text] [Related]
30. The Generalized Robinson-Foulds Distance for Phylogenetic Trees.
Llabrés M; Rosselló F; Valiente G
J Comput Biol; 2021 Dec; 28(12):1181-1195. PubMed ID: 34714118
[TBL] [Abstract][Full Text] [Related]
31. Analysis and visualization of tree space.
Hillis DM; Heath TA; St John K
Syst Biol; 2005 Jun; 54(3):471-82. PubMed ID: 16012112
[TBL] [Abstract][Full Text] [Related]
32. Folding and unfolding phylogenetic trees and networks.
Huber KT; Moulton V; Steel M; Wu T
J Math Biol; 2016 Dec; 73(6-7):1761-1780. PubMed ID: 27107869
[TBL] [Abstract][Full Text] [Related]
33. Scaling neighbor joining to one million taxa with dynamic and heuristic neighbor joining.
Clausen PTLC
Bioinformatics; 2023 Jan; 39(1):. PubMed ID: 36453849
[TBL] [Abstract][Full Text] [Related]
34. Clearcut: a fast implementation of relaxed neighbor joining.
Sheneman L; Evans J; Foster JA
Bioinformatics; 2006 Nov; 22(22):2823-4. PubMed ID: 16982706
[TBL] [Abstract][Full Text] [Related]
35. Distances that perfectly mislead.
Huson DH; Steel M
Syst Biol; 2004 Apr; 53(2):327-32. PubMed ID: 15205056
[TBL] [Abstract][Full Text] [Related]
36. A Poissonian Model of Indel Rate Variation for Phylogenetic Tree Inference.
Zhai Y; Alexandre BC
Syst Biol; 2017 Sep; 66(5):698-714. PubMed ID: 28204784
[TBL] [Abstract][Full Text] [Related]
37. Imputing supertrees and supernetworks from quartets.
Holland B; Conner G; Huber K; Moulton V
Syst Biol; 2007 Feb; 56(1):57-67. PubMed ID: 17366137
[TBL] [Abstract][Full Text] [Related]
38. 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]
39. Optimality of the neighbor joining algorithm and faces of the balanced minimum evolution polytope.
Haws DC; Hodge TL; Yoshida R
Bull Math Biol; 2011 Nov; 73(11):2627-48. PubMed ID: 21373975
[TBL] [Abstract][Full Text] [Related]
40. A new efficient algorithm for inferring explicit hybridization networks following the Neighbor-Joining principle.
Willems M; Tahiri N; Makarenkov V
J Bioinform Comput Biol; 2014 Oct; 12(5):1450024. PubMed ID: 25219384
[TBL] [Abstract][Full Text] [Related]
[Previous] [Next] [New Search]
