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.
116 related articles for article (PubMed ID: 29994585)
41. Inferring rooted species trees from unrooted gene trees using approximate Bayesian computation. Alanzi ARA; Degnan JH Mol Phylogenet Evol; 2017 Nov; 116():13-24. PubMed ID: 28780022 [TBL] [Abstract][Full Text] [Related]
42. Identifying the rooted species tree from the distribution of unrooted gene trees under the coalescent. Allman ES; Degnan JH; Rhodes JA J Math Biol; 2011 Jun; 62(6):833-62. PubMed ID: 20652704 [TBL] [Abstract][Full Text] [Related]
43. Adaptive Tree Proposals for Bayesian Phylogenetic Inference. Meyer X Syst Biol; 2021 Aug; 70(5):1015-1032. PubMed ID: 33515248 [TBL] [Abstract][Full Text] [Related]
44. 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]
45. 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]
46. Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees. Baste J; Paul C; Sau I; Scornavacca C Bull Math Biol; 2017 Apr; 79(4):920-938. PubMed ID: 28247121 [TBL] [Abstract][Full Text] [Related]
48. Linear-time algorithms for phylogenetic tree completion under Robinson-Foulds distance. Bansal MS Algorithms Mol Biol; 2020; 15():6. PubMed ID: 32313549 [TBL] [Abstract][Full Text] [Related]
49. Monte Carlo estimation of total variation distance of Markov chains on large spaces, with application to phylogenetics. Herbei R; Kubatko L Stat Appl Genet Mol Biol; 2013 Mar; 12(1):39-48. PubMed ID: 23459470 [TBL] [Abstract][Full Text] [Related]
50. Trying out a million genes to find the perfect pair with RTIST. Zhelezov G; Degnan JH Bioinformatics; 2022 Jul; 38(14):3565-3573. PubMed ID: 35641003 [TBL] [Abstract][Full Text] [Related]
51. Statistical inconsistency of the unrooted minimize deep coalescence criterion. Alanzi AAR; Degnan JH PLoS One; 2021; 16(5):e0251107. PubMed ID: 33970931 [TBL] [Abstract][Full Text] [Related]
52. An optimal algorithm for computing all subtree repeats in trees. Flouri T; Kobert K; Pissis SP; Stamatakis A Philos Trans A Math Phys Eng Sci; 2014 May; 372(2016):20130140. PubMed ID: 24751873 [TBL] [Abstract][Full Text] [Related]
53. Tree-based unrooted nonbinary phylogenetic networks. Hendriksen M Math Biosci; 2018 Aug; 302():131-138. PubMed ID: 29932953 [TBL] [Abstract][Full Text] [Related]
54. 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]
55. Computing the hybridization number of two phylogenetic trees is fixed-parameter tractable. Bordewich M; Semple C IEEE/ACM Trans Comput Biol Bioinform; 2007; 4(3):458-466. PubMed ID: 17666765 [TBL] [Abstract][Full Text] [Related]
56. Characterizing compatibility and agreement of unrooted trees via cuts in graphs. Vakati S; Fernández-Baca D Algorithms Mol Biol; 2014; 9():13. PubMed ID: 24742332 [TBL] [Abstract][Full Text] [Related]
57. Unrooted genealogical tree probabilities in the infinitely-many-sites model. Griffiths RC; Tavaré S Math Biosci; 1995 May; 127(1):77-98. PubMed ID: 7734858 [TBL] [Abstract][Full Text] [Related]
58. 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]