146 related articles for article (PubMed ID: 34183037)
1. Using Robinson-Foulds supertrees in divide-and-conquer phylogeny estimation.
Yu X; Le T; Christensen SA; Molloy EK; Warnow T
Algorithms Mol Biol; 2021 Jun; 16(1):12. PubMed ID: 34183037
[TBL] [Abstract][Full Text] [Related]
2. FastRFS: fast and accurate Robinson-Foulds Supertrees using constrained exact optimization.
Vachaspati P; Warnow T
Bioinformatics; 2017 Mar; 33(5):631-639. PubMed ID: 27663499
[TBL] [Abstract][Full Text] [Related]
3. Invariant transformers of Robinson and Foulds distance matrices for Convolutional Neural Network.
Tahiri N; Veriga A; Koshkarov A; Morozov B
J Bioinform Comput Biol; 2022 Aug; 20(4):2250012. PubMed ID: 35798684
[TBL] [Abstract][Full Text] [Related]
4. Statistically consistent divide-and-conquer pipelines for phylogeny estimation using NJMerge.
Molloy EK; Warnow T
Algorithms Mol Biol; 2019; 14():14. PubMed ID: 31360216
[TBL] [Abstract][Full Text] [Related]
5. Fast local search for unrooted Robinson-Foulds supertrees.
Chaudhary R; Burleigh JG; Fernández-Baca D
IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(4):1004-13. PubMed ID: 22431553
[TBL] [Abstract][Full Text] [Related]
6. Robinson-Foulds supertrees.
Bansal MS; Burleigh JG; Eulenstein O; Fernández-Baca D
Algorithms Mol Biol; 2010 Feb; 5():18. PubMed ID: 20181274
[TBL] [Abstract][Full Text] [Related]
7. Bad Clade Deletion Supertrees: A Fast and Accurate Supertree Algorithm.
Fleischauer M; Böcker S
Mol Biol Evol; 2017 Sep; 34(9):2408-2421. PubMed ID: 28873954
[TBL] [Abstract][Full Text] [Related]
8. 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]
9. Building alternative consensus trees and supertrees using k-means and Robinson and Foulds distance.
Tahiri N; Fichet B; Makarenkov V
Bioinformatics; 2022 Jun; 38(13):3367-3376. PubMed ID: 35579343
[TBL] [Abstract][Full Text] [Related]
10. Performance of flip supertree construction with a heuristic algorithm.
Eulenstein O; Chen D; Burleigh JG; Fernández-Baca D; Sanderson MJ
Syst Biol; 2004 Apr; 53(2):299-308. PubMed ID: 15205054
[TBL] [Abstract][Full Text] [Related]
11. Problems with supertrees based on the subtree prune-and-regraft distance, with comments on majority rule supertrees.
Goloboff PA; Szumik CA
Cladistics; 2016 Feb; 32(1):82-89. PubMed ID: 34732022
[TBL] [Abstract][Full Text] [Related]
12. SIESTA: enhancing searches for optimal supertrees and species trees.
Vachaspati P; Warnow T
BMC Genomics; 2018 May; 19(Suppl 5):252. PubMed ID: 29745851
[TBL] [Abstract][Full Text] [Related]
13. 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]
14. BCD Beam Search: considering suboptimal partial solutions in Bad Clade Deletion supertrees.
Fleischauer M; Böcker S
PeerJ; 2018; 6():e4987. PubMed ID: 29900080
[TBL] [Abstract][Full Text] [Related]
15. Using max cut to enhance rooted trees consistency.
Snir S; Rao S
IEEE/ACM Trans Comput Biol Bioinform; 2006; 3(4):323-33. PubMed ID: 17085842
[TBL] [Abstract][Full Text] [Related]
16. Split-based computation of majority-rule supertrees.
Kupczok A
BMC Evol Biol; 2011 Jul; 11():205. PubMed ID: 21752249
[TBL] [Abstract][Full Text] [Related]
17. Supertree construction in the genomic age.
Bininda-Emonds OR
Methods Enzymol; 2005; 395():745-57. PubMed ID: 15865993
[TBL] [Abstract][Full Text] [Related]
18. Triplet supertree heuristics for the tree of life.
Lin HT; Burleigh JG; Eulenstein O
BMC Bioinformatics; 2009 Jan; 10 Suppl 1(Suppl 1):S8. PubMed ID: 19208181
[TBL] [Abstract][Full Text] [Related]
19. The evolution of supertrees.
Bininda-Emonds OR
Trends Ecol Evol; 2004 Jun; 19(6):315-22. PubMed ID: 16701277
[TBL] [Abstract][Full Text] [Related]
20. Constrained incremental tree building: new absolute fast converging phylogeny estimation methods with improved scalability and accuracy.
Zhang Q; Rao S; Warnow T
Algorithms Mol Biol; 2019; 14():2. PubMed ID: 30839943
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
