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.
136 related articles for article (PubMed ID: 21034464)
61. BIMLR: a method for constructing rooted phylogenetic networks from rooted phylogenetic trees. Wang J; Guo M; Xing L; Che K; Liu X; Wang C Gene; 2013 Sep; 527(1):344-51. PubMed ID: 23816409 [TBL] [Abstract][Full Text] [Related]
62. On the elusiveness of clusters. Kelk SM; Scornavacca C; van Iersel L IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(2):517-34. PubMed ID: 21968961 [TBL] [Abstract][Full Text] [Related]
63. Molecular clock fork phylogenies: closed form analytic maximum likelihood solutions. Chor B; Snir S Syst Biol; 2004 Dec; 53(6):963-7. PubMed ID: 15764563 [TBL] [Abstract][Full Text] [Related]
64. Stochastic models for horizontal gene transfer: taking a random walk through tree space. Suchard MA Genetics; 2005 May; 170(1):419-31. PubMed ID: 15781714 [TBL] [Abstract][Full Text] [Related]
65. Comparing copy-number profiles under multi-copy amplifications and deletions. Cordonnier G; Lafond M BMC Genomics; 2020 Apr; 21(Suppl 2):198. PubMed ID: 32299350 [TBL] [Abstract][Full Text] [Related]
68. Computing a smallest multilabeled phylogenetic tree from rooted triplets. Guillemot S; Jansson J; Sung WK IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(4):1141-7. PubMed ID: 20733243 [TBL] [Abstract][Full Text] [Related]
69. On the impact of uncertain gene tree rooting on duplication-transfer-loss reconciliation. Kundu S; Bansal MS BMC Bioinformatics; 2018 Aug; 19(Suppl 9):290. PubMed ID: 30367593 [TBL] [Abstract][Full Text] [Related]
71. Reconstructing a SuperGeneTree minimizing reconciliation. Lafond M; Ouangraoua A; El-Mabrouk N BMC Bioinformatics; 2015; 16 Suppl 14(Suppl 14):S4. PubMed ID: 26451911 [TBL] [Abstract][Full Text] [Related]
72. A partial order and cluster-similarity metric on rooted phylogenetic trees. Hendriksen M; Francis A J Math Biol; 2020 Apr; 80(5):1265-1290. PubMed ID: 32067071 [TBL] [Abstract][Full Text] [Related]
73. Netcombin: An algorithm for constructing optimal phylogenetic network from rooted triplets. Poormohammadi H; Sardari Zarchi M PLoS One; 2020; 15(9):e0227842. PubMed ID: 32947609 [TBL] [Abstract][Full Text] [Related]
74. URec: a system for unrooted reconciliation. Górecki P; Tiuryn J Bioinformatics; 2007 Feb; 23(4):511-2. PubMed ID: 17182699 [TBL] [Abstract][Full Text] [Related]
75. A program to compute the soft Robinson-Foulds distance between phylogenetic networks. Lu B; Zhang L; Leong HW BMC Genomics; 2017 Mar; 18(Suppl 2):111. PubMed ID: 28361712 [TBL] [Abstract][Full Text] [Related]
76. Counting and sampling gene family evolutionary histories in the duplication-loss and duplication-loss-transfer models. Chauve C; Ponty Y; Wallner M J Math Biol; 2020 Apr; 80(5):1353-1388. PubMed ID: 32060618 [TBL] [Abstract][Full Text] [Related]
77. 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]
78. Calculation, visualization, and manipulation of MASTs (Maximum Agreement Subtrees). Dong S; Kraemer E Proc IEEE Comput Syst Bioinform Conf; 2004; ():405-14. PubMed ID: 16448033 [TBL] [Abstract][Full Text] [Related]
79. A weighted least-squares approach for inferring phylogenies from incomplete distance matrices. Makarenkov V; Lapointe FJ Bioinformatics; 2004 Sep; 20(13):2113-21. PubMed ID: 15059836 [TBL] [Abstract][Full Text] [Related]
80. 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] [Previous] [Next] [New Search]