264 related articles for article (PubMed ID: 26355780)
21. An efficient algorithm for approximating geodesic distances in tree space.
Battagliero S; Puglia G; Vicario S; Rubino F; Scioscia G; Leo P
IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(5):1196-207. PubMed ID: 21116041
[TBL] [Abstract][Full Text] [Related]
22. Deep metazoan phylogeny.
Gerlach D; Wolf M; Dandekar T; Müller T; Pokorny A; Rahmann S
In Silico Biol; 2007; 7(2):151-4. PubMed ID: 17688440
[TBL] [Abstract][Full Text] [Related]
23. constNJ: an algorithm to reconstruct sets of phylogenetic trees satisfying pairwise topological constraints.
Matsen FA
J Comput Biol; 2010 Jun; 17(6):799-818. PubMed ID: 20500096
[TBL] [Abstract][Full Text] [Related]
24. BOOL-AN: a method for comparative sequence analysis and phylogenetic reconstruction.
Jakó E; Ari E; Ittzés P; Horváth A; Podani J
Mol Phylogenet Evol; 2009 Sep; 52(3):887-97. PubMed ID: 19422923
[TBL] [Abstract][Full Text] [Related]
25. 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]
26. 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]
27. A metric on the space of reduced phylogenetic networks.
Nakhleh L
IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(2):218-22. PubMed ID: 20431142
[TBL] [Abstract][Full Text] [Related]
28. Maximum similarity: a new formulation of phylogenetic reconstruction.
Huang X; Vingron M
J Comput Biol; 2009 Jul; 16(7):887-96. PubMed ID: 19580518
[TBL] [Abstract][Full Text] [Related]
29. 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]
30. 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]
31. Fast computation of distance estimators.
Elias I; Lagergren J
BMC Bioinformatics; 2007 Mar; 8():89. PubMed ID: 17355623
[TBL] [Abstract][Full Text] [Related]
32. 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]
33. Reconstruction of ancestral genomic sequences using likelihood.
Elias I; Tuller T
J Comput Biol; 2007 Mar; 14(2):216-37. PubMed ID: 17456016
[TBL] [Abstract][Full Text] [Related]
34. A metric for phylogenetic trees based on matching.
Lin Y; Rajan V; Moret BM
IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(4):1014-22. PubMed ID: 22184263
[TBL] [Abstract][Full Text] [Related]
35. Whole-genome prokaryotic phylogeny.
Henz SR; Huson DH; Auch AF; Nieselt-Struwe K; Schuster SC
Bioinformatics; 2005 May; 21(10):2329-35. PubMed ID: 15166018
[TBL] [Abstract][Full Text] [Related]
36. Polytomies and Bayesian phylogenetic inference.
Lewis PO; Holder MT; Holsinger KE
Syst Biol; 2005 Apr; 54(2):241-53. PubMed ID: 16012095
[TBL] [Abstract][Full Text] [Related]
37. Robustness of phylogenetic inference based on minimum evolution.
Pardi F; Guillemot S; Gascuel O
Bull Math Biol; 2010 Oct; 72(7):1820-39. PubMed ID: 20449671
[TBL] [Abstract][Full Text] [Related]
38. Fast and accurate phylogeny reconstruction algorithms based on the minimum-evolution principle.
Desper R; Gascuel O
J Comput Biol; 2002; 9(5):687-705. PubMed ID: 12487758
[TBL] [Abstract][Full Text] [Related]
39. Combinatorics of distance-based tree inference.
Pardi F; Gascuel O
Proc Natl Acad Sci U S A; 2012 Oct; 109(41):16443-8. PubMed ID: 23012403
[TBL] [Abstract][Full Text] [Related]
40. Phylogeny inference based on spectral graph clustering.
Zhang SB; Zhou SY; He JG; Lai JH
J Comput Biol; 2011 Apr; 18(4):627-37. PubMed ID: 21352066
[TBL] [Abstract][Full Text] [Related]
[Previous] [Next] [New Search]
