These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
163 related articles for article (PubMed ID: 19204804)
41. Problems with supertrees based on the subtree prune-and-regraft distance, with comments on majority rule supertrees. Goloboff PA; Szumik CA Cladistics; 2016 Feb; 32(1):82-89. PubMed ID: 34732022 [TBL] [Abstract][Full Text] [Related]
42. Estimating species trees from unrooted gene trees. Liu L; Yu L Syst Biol; 2011 Oct; 60(5):661-7. PubMed ID: 21447481 [TBL] [Abstract][Full Text] [Related]
43. 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]
44. Fast local search for unrooted Robinson-Foulds supertrees. Chaudhary R; Burleigh JG; Fernández-Baca D IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(4):1004-13. PubMed ID: 22431553 [TBL] [Abstract][Full Text] [Related]
45. Reconstructing Unrooted Phylogenetic Trees from Symbolic Ternary Metrics. Grünewald S; Long Y; Wu Y Bull Math Biol; 2018 Jun; 80(6):1563-1577. PubMed ID: 29524097 [TBL] [Abstract][Full Text] [Related]
46. Matching split distance for unrooted binary phylogenetic trees. Bogdanowicz D; Giaro K IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(1):150-60. PubMed ID: 21383415 [TBL] [Abstract][Full Text] [Related]
48. 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]
49. Harvesting evolutionary signals in a forest of prokaryotic gene trees. Schliep K; Lopez P; Lapointe FJ; Bapteste E Mol Biol Evol; 2011 Apr; 28(4):1393-405. PubMed ID: 21172835 [TBL] [Abstract][Full Text] [Related]
50. MASTtreedist: visualization of tree space based on maximum agreement subtree. Huang H; Li Y J Comput Biol; 2013 Jan; 20(1):42-9. PubMed ID: 23294272 [TBL] [Abstract][Full Text] [Related]
51. Using max cut to enhance rooted trees consistency. Snir S; Rao S IEEE/ACM Trans Comput Biol Bioinform; 2006; 3(4):323-33. PubMed ID: 17085842 [TBL] [Abstract][Full Text] [Related]
52. Breakpoint medians and breakpoint phylogenies: a fixed-parameter approach. Gramm J; Niedermeier R Bioinformatics; 2002; 18 Suppl 2():S128-39. PubMed ID: 12385994 [TBL] [Abstract][Full Text] [Related]
54. Unrooted tree reconciliation: a unified approach. Górecki P; Eulenstein O; Tiuryn J IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(2):522-36. PubMed ID: 23929875 [TBL] [Abstract][Full Text] [Related]
55. 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]
57. 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]
59. Neighborhoods of trees in circular orderings. Bastkowski S; Moulton V; Spillner A; Wu T Bull Math Biol; 2015 Jan; 77(1):46-70. PubMed ID: 25477080 [TBL] [Abstract][Full Text] [Related]
60. Property and efficiency of the maximum likelihood method for molecular phylogeny. Saitou N J Mol Evol; 1988; 27(3):261-73. PubMed ID: 3138428 [TBL] [Abstract][Full Text] [Related] [Previous] [Next] [New Search]