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.
464 related articles for article (PubMed ID: 15513992)
1. DPRml: distributed phylogeny reconstruction by maximum likelihood. Keane TM; Naughton TJ; Travers SA; McInerney JO; McCormack GP Bioinformatics; 2005 Apr; 21(7):969-74. PubMed ID: 15513992 [TBL] [Abstract][Full Text] [Related]
2. MultiPhyl: a high-throughput phylogenomics webserver using distributed computing. Keane TM; Naughton TJ; McInerney JO Nucleic Acids Res; 2007 Jul; 35(Web Server issue):W33-7. PubMed ID: 17553837 [TBL] [Abstract][Full Text] [Related]
3. pIQPNNI: parallel reconstruction of large maximum likelihood phylogenies. Minh BQ; Vinh le S; von Haeseler A; Schmidt HA Bioinformatics; 2005 Oct; 21(19):3794-6. PubMed ID: 16046495 [TBL] [Abstract][Full Text] [Related]
4. 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]
5. SATe-II: very fast and accurate simultaneous estimation of multiple sequence alignments and phylogenetic trees. Liu K; Warnow TJ; Holder MT; Nelesen SM; Yu J; Stamatakis AP; Linder CR Syst Biol; 2012 Jan; 61(1):90-106. PubMed ID: 22139466 [TBL] [Abstract][Full Text] [Related]
7. Maximum likelihood of phylogenetic networks. Jin G; Nakhleh L; Snir S; Tuller T Bioinformatics; 2006 Nov; 22(21):2604-11. PubMed ID: 16928736 [TBL] [Abstract][Full Text] [Related]
8. Rapid and accurate large-scale coestimation of sequence alignments and phylogenetic trees. Liu K; Raghavan S; Nelesen S; Linder CR; Warnow T Science; 2009 Jun; 324(5934):1561-4. PubMed ID: 19541996 [TBL] [Abstract][Full Text] [Related]
9. Representation in stochastic search for phylogenetic tree reconstruction. Weber G; Ohno-Machado L; Shieber S J Biomed Inform; 2006 Feb; 39(1):43-50. PubMed ID: 16359929 [TBL] [Abstract][Full Text] [Related]
10. Upper bounds on maximum likelihood for phylogenetic trees. Hendy MD; Holland BR Bioinformatics; 2003 Oct; 19 Suppl 2():ii66-72. PubMed ID: 14534174 [TBL] [Abstract][Full Text] [Related]
11. AxML: a fast program for sequential and parallel phylogenetic tree calculations based on the maximum likelihood method. Stamatakis AP; Ludwig T; Meier H; Wolf MJ Proc IEEE Comput Soc Bioinform Conf; 2002; 1():21-8. PubMed ID: 15838120 [TBL] [Abstract][Full Text] [Related]
12. A short proof that phylogenetic tree reconstruction by maximum likelihood is hard. Roch S IEEE/ACM Trans Comput Biol Bioinform; 2006; 3(1):92-4. PubMed ID: 17048396 [TBL] [Abstract][Full Text] [Related]
14. New approaches to phylogenetic tree search and their application to large numbers of protein alignments. Whelan S Syst Biol; 2007 Oct; 56(5):727-40. PubMed ID: 17849327 [TBL] [Abstract][Full Text] [Related]
15. Efficient inference on known phylogenetic trees using Poisson regression. Rosset S Bioinformatics; 2007 Jan; 23(2):e142-7. PubMed ID: 17237083 [TBL] [Abstract][Full Text] [Related]
17. Maximum-likelihood analysis using TREE-PUZZLE. Schmidt HA; von Haeseler A Curr Protoc Bioinformatics; 2007 Mar; Chapter 6():Unit 6.6. PubMed ID: 18428792 [TBL] [Abstract][Full Text] [Related]
18. Toward extracting all phylogenetic information from matrices of evolutionary distances. Roch S Science; 2010 Mar; 327(5971):1376-9. PubMed ID: 20223986 [TBL] [Abstract][Full Text] [Related]