118 related articles for article (PubMed ID: 34879631)
1. Calculating SPR distances between trees.
Goloboff PA
Cladistics; 2008 Aug; 24(4):591-597. PubMed ID: 34879631
[TBL] [Abstract][Full Text] [Related]
2. SPRIT: Identifying horizontal gene transfer in rooted phylogenetic trees.
Hill T; Nordström KJ; Thollesson M; Säfström TM; Vernersson AK; Fredriksson R; Schiöth HB
BMC Evol Biol; 2010 Feb; 10():42. PubMed ID: 20152048
[TBL] [Abstract][Full Text] [Related]
3. SPR distance computation for unrooted trees.
Hickey G; Dehne F; Rau-Chaplin A; Blouin C
Evol Bioinform Online; 2008 Feb; 4():17-27. PubMed ID: 19204804
[TBL] [Abstract][Full Text] [Related]
4. Phylogenetic identification of lateral genetic transfer events.
Beiko RG; Hamilton N
BMC Evol Biol; 2006 Feb; 6():15. PubMed ID: 16472400
[TBL] [Abstract][Full Text] [Related]
5. Inferring species trees from incongruent multi-copy gene trees using the Robinson-Foulds distance.
Chaudhary R; Burleigh JG; Fernández-Baca D
Algorithms Mol Biol; 2013 Nov; 8(1):28. PubMed ID: 24180377
[TBL] [Abstract][Full Text] [Related]
6. Improving the efficiency of SPR moves in phylogenetic tree search methods based on maximum likelihood.
Hordijk W; Gascuel O
Bioinformatics; 2005 Dec; 21(24):4338-47. PubMed ID: 16234323
[TBL] [Abstract][Full Text] [Related]
7. A practical method for exact computation of subtree prune and regraft distance.
Wu Y
Bioinformatics; 2009 Jan; 25(2):190-6. PubMed ID: 19019848
[TBL] [Abstract][Full Text] [Related]
8. Distance Wagner tree refinement as a heuristic approach to character-based initial tree construction.
Wheeler WC
Cladistics; 2021 Dec; 37(6):829-837. PubMed ID: 34841584
[TBL] [Abstract][Full Text] [Related]
9. 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]
10. 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]
11. On the fixed parameter tractability of agreement-based phylogenetic distances.
Bordewich M; Scornavacca C; Tokac N; Weller M
J Math Biol; 2017 Jan; 74(1-2):239-257. PubMed ID: 27221239
[TBL] [Abstract][Full Text] [Related]
12. A polynomial-time algorithm computing lower and upper bounds of the rooted subtree prune and regraft distance.
Kannan L; Li H; Mushegian A
J Comput Biol; 2011 May; 18(5):743-57. PubMed ID: 21166560
[TBL] [Abstract][Full Text] [Related]
13. Cubic time algorithms of amalgamating gene trees and building evolutionary scenarios.
Lyubetsky VA; Rubanov LI; Rusin LY; Gorbunov KY
Biol Direct; 2012 Dec; 7():48. PubMed ID: 23259766
[TBL] [Abstract][Full Text] [Related]
14. ENJ algorithm can construct triple phylogenetic trees.
Hong Y; Guo M; Wang J
Mol Ther Nucleic Acids; 2021 Mar; 23():286-293. PubMed ID: 33425487
[TBL] [Abstract][Full Text] [Related]
15. Heuristics for unrooted, unranked, and ranked anomaly zones under birth-death models.
Kim A; Degnan JH
Mol Phylogenet Evol; 2021 Aug; 161():107162. PubMed ID: 33831548
[TBL] [Abstract][Full Text] [Related]
16. Detecting lateral gene transfers by statistical reconciliation of phylogenetic forests.
Abby SS; Tannier E; Gouy M; Daubin V
BMC Bioinformatics; 2010 Jun; 11():324. PubMed ID: 20550700
[TBL] [Abstract][Full Text] [Related]
17. 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]
18. Supertrees Based on the Subtree Prune-and-Regraft Distance.
Whidden C; Zeh N; Beiko RG
Syst Biol; 2014 Jul; 63(4):566-81. PubMed ID: 24695589
[TBL] [Abstract][Full Text] [Related]
19. A clique-based method using dynamic programming for computing edit distance between unordered trees.
Mori T; Tamura T; Fukagawa D; Takasu A; Tomita E; Akutsu T
J Comput Biol; 2012 Oct; 19(10):1089-104. PubMed ID: 23057820
[TBL] [Abstract][Full Text] [Related]
20. An algorithm for constructing parsimonious hybridization networks with multiple phylogenetic trees.
Wu Y
J Comput Biol; 2013 Oct; 20(10):792-804. PubMed ID: 24093230
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
