328 related articles for article (PubMed ID: 14534174)
1. 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]
2. 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]
3. 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]
4. Reconstructing phylogeny by quadratically approximated maximum likelihood.
Woodhams MD; Hendy MD
Bioinformatics; 2004 Aug; 20 Suppl 1():i348-54. PubMed ID: 15262819
[TBL] [Abstract][Full Text] [Related]
5. Bayesian coestimation of phylogeny and sequence alignment.
Lunter G; Miklós I; Drummond A; Jensen JL; Hein J
BMC Bioinformatics; 2005 Apr; 6():83. PubMed ID: 15804354
[TBL] [Abstract][Full Text] [Related]
6. 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]
7. 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]
8. 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]
9. Approximate maximum parsimony and ancestral maximum likelihood.
Alon N; Chor B; Pardi F; Rapoport A
IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(1):183-7. PubMed ID: 20150680
[TBL] [Abstract][Full Text] [Related]
10. 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]
11. 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]
12. Quartet-mapping, a generalization of the likelihood-mapping procedure.
Nieselt-Struwe K; von Haeseler A
Mol Biol Evol; 2001 Jul; 18(7):1204-19. PubMed ID: 11420361
[TBL] [Abstract][Full Text] [Related]
13. Bayesian and maximum likelihood phylogenetic analyses of protein sequence data under relative branch-length differences and model violation.
Mar JC; Harlow TJ; Ragan MA
BMC Evol Biol; 2005 Jan; 5():8. PubMed ID: 15676079
[TBL] [Abstract][Full Text] [Related]
14. 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]
15. Phylogenetic trees based on gene content.
Huson DH; Steel M
Bioinformatics; 2004 Sep; 20(13):2044-9. PubMed ID: 15044248
[TBL] [Abstract][Full Text] [Related]
16. Computing the all-pairs quartet distance on a set of evolutionary trees.
Stissing M; Mailund T; Pedersen CN; Brodal GS; Fagerberg R
J Bioinform Comput Biol; 2008 Feb; 6(1):37-50. PubMed ID: 18324744
[TBL] [Abstract][Full Text] [Related]
17. 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]
18. Ancestral maximum likelihood of evolutionary trees is hard.
Addario-Berry L; Chor B; Hallett M; Lagergren J; Panconesi A; Wareham T
J Bioinform Comput Biol; 2004 Jun; 2(2):257-71. PubMed ID: 15297981
[TBL] [Abstract][Full Text] [Related]
19. 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]
20. Improved parameterized complexity of the maximum agreement subtree and maximum compatible tree problems.
Berry V; Nicolas F
IEEE/ACM Trans Comput Biol Bioinform; 2006; 3(3):289-302. PubMed ID: 17048466
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
