148 related articles for article (PubMed ID: 19179704)
21. 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]
22. Polyhedral geometry of phylogenetic rogue taxa.
Cueto MA; Matsen FA
Bull Math Biol; 2011 Jun; 73(6):1202-26. PubMed ID: 20640527
[TBL] [Abstract][Full Text] [Related]
23. 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]
24. The K tree score: quantification of differences in the relative branch length and topology of phylogenetic trees.
Soria-Carrasco V; Talavera G; Igea J; Castresana J
Bioinformatics; 2007 Nov; 23(21):2954-6. PubMed ID: 17890735
[TBL] [Abstract][Full Text] [Related]
25. 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]
26. Bayesian coestimation of phylogeny and sequence alignment.
Lunter G; Miklós I; Drummond A; Jensen JL; Hein J
BMC Bioinformatics; 2005 Apr; 6():83. PubMed ID: 15804354
[TBL] [Abstract][Full Text] [Related]
27. The gene-duplication problem: near-linear time algorithms for NNI-based local searches.
Bansal MS; Eulenstein O; Wehe A
IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(2):221-31. PubMed ID: 19407347
[TBL] [Abstract][Full Text] [Related]
28. On Nakhleh's metric for reduced phylogenetic networks.
Cardona G; Llabrés M; Rosselló F; Valiente G
IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(4):629-38. PubMed ID: 19875861
[TBL] [Abstract][Full Text] [Related]
29. 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]
30. Progressive tree neighborhood applied to the maximum parsimony problem.
Goëffon A; Richer JM; Hao JK
IEEE/ACM Trans Comput Biol Bioinform; 2008; 5(1):136-45. PubMed ID: 18245882
[TBL] [Abstract][Full Text] [Related]
31. Accuracy of estimated phylogenetic trees from molecular data. II. Gene frequency data.
Nei M; Tajima F; Tateno Y
J Mol Evol; 1983; 19(2):153-70. PubMed ID: 6571220
[TBL] [Abstract][Full Text] [Related]
32. Supertrees Based on the Subtree Prune-and-Regraft Distance.
Whidden C; Zeh N; Beiko RG
Syst Biol; 2014 Jul; 63(4):566-81. PubMed ID: 24695589
[TBL] [Abstract][Full Text] [Related]
33. A stepwise algorithm for finding minimum evolution trees.
Kumar S
Mol Biol Evol; 1996 Apr; 13(4):584-93. PubMed ID: 8882501
[TBL] [Abstract][Full Text] [Related]
34. Metrics on multilabeled trees: interrelationships and diameter bounds.
Huber KT; Spillner A; Suchecki R; Moulton V
IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(4):1029-40. PubMed ID: 21116046
[TBL] [Abstract][Full Text] [Related]
35. On Hill et al's conjecture for calculating the subtree prune and regraft distance between phylogenies.
Linz S
BMC Evol Biol; 2010 Oct; 10():334. PubMed ID: 21034464
[TBL] [Abstract][Full Text] [Related]
36. A metric on the space of reduced phylogenetic networks.
Nakhleh L
IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(2):218-22. PubMed ID: 20431142
[TBL] [Abstract][Full Text] [Related]
37. Genetic algorithm-based maximum-likelihood analysis for molecular phylogeny.
Katoh K; Kuma K; Miyata T
J Mol Evol; 2001; 53(4-5):477-84. PubMed ID: 11675608
[TBL] [Abstract][Full Text] [Related]
38. 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]
39. On the complexity of uSPR distance.
Bonet ML; St John K
IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(3):572-6. PubMed ID: 20671326
[TBL] [Abstract][Full Text] [Related]
40. Refining phylogenetic trees given additional data: an algorithm based on parsimony.
Wu T; Moulton V; Steel M
IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(1):118-25. PubMed ID: 19179705
[TBL] [Abstract][Full Text] [Related]
[Previous] [Next] [New Search]
