124 related articles for article (PubMed ID: 26345805)
1. A fast neighbor joining method.
Li JF
Genet Mol Res; 2015 Jul; 14(3):8733-43. PubMed ID: 26345805
[TBL] [Abstract][Full Text] [Related]
2. 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]
3. FastJoin, an improved neighbor-joining algorithm.
Wang J; Guo MZ; Xing LL
Genet Mol Res; 2012 Jul; 11(3):1909-22. PubMed ID: 22869546
[TBL] [Abstract][Full Text] [Related]
4. Relaxed neighbor joining: a fast distance-based phylogenetic tree construction method.
Evans J; Sheneman L; Foster J
J Mol Evol; 2006 Jun; 62(6):785-92. PubMed ID: 16752216
[TBL] [Abstract][Full Text] [Related]
5. A signal-to-noise analysis of phylogeny estimation by neighbor-joining: Insufficiency of polynomial length sequences.
Lacey MR; Chang JT
Math Biosci; 2006 Feb; 199(2):188-215. PubMed ID: 16412478
[TBL] [Abstract][Full Text] [Related]
6. Species tree estimation using Neighbor Joining.
Rusinko J; McPartlon M
J Theor Biol; 2017 Feb; 414():5-7. PubMed ID: 27866979
[TBL] [Abstract][Full Text] [Related]
7. A multi-neighbor-joining approach for phylogenetic tree reconstruction and visualization.
Silva AE; Villanueva WJ; Knidel H; Bonato VC; Reis SF; Von Zuben FJ
Genet Mol Res; 2005 Sep; 4(3):525-34. PubMed ID: 16342037
[TBL] [Abstract][Full Text] [Related]
8. Neighbor joining algorithms for inferring phylogenies via LCA distances.
Gronau I; Moran S
J Comput Biol; 2007; 14(1):1-15. PubMed ID: 17381342
[TBL] [Abstract][Full Text] [Related]
9. 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]
10. IQPNNI: moving fast through tree space and stopping in time.
Vinh le S; Von Haeseler A
Mol Biol Evol; 2004 Aug; 21(8):1565-71. PubMed ID: 15163768
[TBL] [Abstract][Full Text] [Related]
11. 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]
12. QuickJoin--fast neighbour-joining tree reconstruction.
Mailund T; Pedersen CN
Bioinformatics; 2004 Nov; 20(17):3261-2. PubMed ID: 15201185
[TBL] [Abstract][Full Text] [Related]
13. Fast computation of distance estimators.
Elias I; Lagergren J
BMC Bioinformatics; 2007 Mar; 8():89. PubMed ID: 17355623
[TBL] [Abstract][Full Text] [Related]
14. Neighbor-net: an agglomerative method for the construction of phylogenetic networks.
Bryant D; Moulton V
Mol Biol Evol; 2004 Feb; 21(2):255-65. PubMed ID: 14660700
[TBL] [Abstract][Full Text] [Related]
15. Beyond pairwise distances: neighbor-joining with phylogenetic diversity estimates.
Levy D; Yoshida R; Pachter L
Mol Biol Evol; 2006 Mar; 23(3):491-8. PubMed ID: 16280538
[TBL] [Abstract][Full Text] [Related]
16. The accuracy of fast phylogenetic methods for large datasets.
Nakhleh L; Moret BM; Roshan U; St John K; Sun J; Warnow T
Pac Symp Biocomput; 2002; ():211-22. PubMed ID: 11928477
[TBL] [Abstract][Full Text] [Related]
17. BOOL-AN: a method for comparative sequence analysis and phylogenetic reconstruction.
Jakó E; Ari E; Ittzés P; Horváth A; Podani J
Mol Phylogenet Evol; 2009 Sep; 52(3):887-97. PubMed ID: 19422923
[TBL] [Abstract][Full Text] [Related]
18. Prospects for inferring very large phylogenies by using the neighbor-joining method.
Tamura K; Nei M; Kumar S
Proc Natl Acad Sci U S A; 2004 Jul; 101(30):11030-5. PubMed ID: 15258291
[TBL] [Abstract][Full Text] [Related]
19. Recrafting the neighbor-joining method.
Mailund T; Brodal GS; Fagerberg R; Pedersen CN; Phillips D
BMC Bioinformatics; 2006 Jan; 7():29. PubMed ID: 16423304
[TBL] [Abstract][Full Text] [Related]
20. A simulation comparison of phylogeny algorithms under equal and unequal evolutionary rates.
Kuhner MK; Felsenstein J
Mol Biol Evol; 1994 May; 11(3):459-68. PubMed ID: 8015439
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
