318 related articles for article (PubMed ID: 17085842)
1. 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]
2. 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]
3. 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]
4. Accurate phylogenetic tree reconstruction from quartets: a heuristic approach.
Reaz R; Bayzid MS; Rahman MS
PLoS One; 2014; 9(8):e104008. PubMed ID: 25117474
[TBL] [Abstract][Full Text] [Related]
5. Quartet MaxCut: a fast algorithm for amalgamating quartet trees.
Snir S; Rao S
Mol Phylogenet Evol; 2012 Jan; 62(1):1-8. PubMed ID: 21762785
[TBL] [Abstract][Full Text] [Related]
6. The Performance of Two Supertree Schemes Compared Using Synthetic and Real Data Quartet Input.
Avni E; Yona Z; Cohen R; Snir S
J Mol Evol; 2018 Feb; 86(2):150-165. PubMed ID: 29460038
[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. 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]
9. Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees.
Baste J; Paul C; Sau I; Scornavacca C
Bull Math Biol; 2017 Apr; 79(4):920-938. PubMed ID: 28247121
[TBL] [Abstract][Full Text] [Related]
10. Robustness of topological supertree methods for reconciling dense incompatible data.
Willson SJ
IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(1):62-75. PubMed ID: 19179699
[TBL] [Abstract][Full Text] [Related]
11. 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]
12. Improving quartet graph construction for scalable and accurate species tree estimation from gene trees.
Han Y; Molloy EK
Genome Res; 2023 Jul; 33(7):1042-1052. PubMed ID: 37197990
[TBL] [Abstract][Full Text] [Related]
13. 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]
14. 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]
15. Constructing phylogenies from quartets: elucidation of eutherian superordinal relationships.
Ben-Dor A; Chor B; Graur D; Ophir R; Pelleg D
J Comput Biol; 1998; 5(3):377-90. PubMed ID: 9773339
[TBL] [Abstract][Full Text] [Related]
16. 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]
17. Constructing rooted supertrees using distances.
Willson SJ
Bull Math Biol; 2004 Nov; 66(6):1755-83. PubMed ID: 15522354
[TBL] [Abstract][Full Text] [Related]
18. Reconstructing a SuperGeneTree minimizing reconciliation.
Lafond M; Ouangraoua A; El-Mabrouk N
BMC Bioinformatics; 2015; 16 Suppl 14(Suppl 14):S4. PubMed ID: 26451911
[TBL] [Abstract][Full Text] [Related]
19. COSPEDTree: COuplet Supertree by Equivalence Partitioning of Taxa Set and DAG Formation.
Bhattacharyya S; Mukherjee J
IEEE/ACM Trans Comput Biol Bioinform; 2015; 12(3):590-603. PubMed ID: 26357270
[TBL] [Abstract][Full Text] [Related]
20. Comparative performance of supertree algorithms in large data sets using the soapberry family (Sapindaceae) as a case study.
Buerki S; Forest F; Salamin N; Alvarez N
Syst Biol; 2011 Jan; 60(1):32-44. PubMed ID: 21068445
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
