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.
155 related articles for article (PubMed ID: 19204804)
61. 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]
62. A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions. Bader M; Abouelhoda MI; Ohlebusch E BMC Bioinformatics; 2008 Dec; 9():516. PubMed ID: 19055792 [TBL] [Abstract][Full Text] [Related]
64. Cophenetic Median Trees. Markin A; Eulenstein O IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(5):1459-1470. PubMed ID: 30222583 [TBL] [Abstract][Full Text] [Related]
65. Quartets MaxCut: a divide and conquer quartets algorithm. Snir S; Rao S IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(4):704-18. PubMed ID: 21030737 [TBL] [Abstract][Full Text] [Related]
66. Efficient Local Search for Euclidean Path-Difference Median Trees. Markin A; Eulenstein O IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(4):1374-1385. PubMed ID: 29035224 [TBL] [Abstract][Full Text] [Related]
67. Comparison of additive trees using circular orders. Makarenkov V; Leclerc B J Comput Biol; 2000; 7(5):731-44. PubMed ID: 11153096 [TBL] [Abstract][Full Text] [Related]
68. On the Shapley Value of Unrooted Phylogenetic Trees. Wicke K; Fischer M Bull Math Biol; 2019 Feb; 81(2):618-638. PubMed ID: 29344760 [TBL] [Abstract][Full Text] [Related]
69. Autumn Algorithm-Computation of Hybridization Networks for Realistic Phylogenetic Trees. Huson DH; Linz S IEEE/ACM Trans Comput Biol Bioinform; 2018; 15(2):398-410. PubMed ID: 26955052 [TBL] [Abstract][Full Text] [Related]
70. A reconstruction problem for a class of phylogenetic networks with lateral gene transfers. Cardona G; Pons JC; Rosselló F Algorithms Mol Biol; 2015; 10():28. PubMed ID: 26691555 [TBL] [Abstract][Full Text] [Related]
71. Computing the skewness of the phylogenetic mean pairwise distance in linear time. Tsirogiannis C; Sandel B Algorithms Mol Biol; 2014; 9():15. PubMed ID: 25093036 [TBL] [Abstract][Full Text] [Related]
72. Approximating subtree distances between phylogenies. Bonet ML; St John K; Mahindru R; Amenta N J Comput Biol; 2006 Oct; 13(8):1419-34. PubMed ID: 17061919 [TBL] [Abstract][Full Text] [Related]
73. Designing an A* algorithm for calculating edit distance between rooted-unordered trees. Horesh Y; Mehr R; Unger R J Comput Biol; 2006; 13(6):1165-76. PubMed ID: 16901235 [TBL] [Abstract][Full Text] [Related]
74. tqDist: a library for computing the quartet and triplet distances between binary or general trees. Sand A; Holt MK; Johansen J; Brodal GS; Mailund T; Pedersen CN Bioinformatics; 2014 Jul; 30(14):2079-80. PubMed ID: 24651968 [TBL] [Abstract][Full Text] [Related]
75. Coalescent-based species tree inference from gene tree topologies under incomplete lineage sorting by maximum likelihood. Wu Y Evolution; 2012 Mar; 66(3):763-775. PubMed ID: 22380439 [TBL] [Abstract][Full Text] [Related]
76. On the quality of tree-based protein classification. Lazareva-Ulitsky B; Diemer K; Thomas PD Bioinformatics; 2005 May; 21(9):1876-90. PubMed ID: 15647305 [TBL] [Abstract][Full Text] [Related]
77. Inferring and validating horizontal gene transfer events using bipartition dissimilarity. Boc A; Philippe H; Makarenkov V Syst Biol; 2010 Mar; 59(2):195-211. PubMed ID: 20525630 [TBL] [Abstract][Full Text] [Related]
78. 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]