151 related articles for article (PubMed ID: 22229028)
1. Polynomial supertree methods revisited.
Brinkmeyer M; Griebel T; Böcker S
Adv Bioinformatics; 2011; 2011():524182. PubMed ID: 22229028
[TBL] [Abstract][Full Text] [Related]
2. PhySIC_IST: cleaning source trees to infer more informative supertrees.
Scornavacca C; Berry V; Lefort V; Douzery EJ; Ranwez V
BMC Bioinformatics; 2008 Oct; 9():413. PubMed ID: 18834542
[TBL] [Abstract][Full Text] [Related]
3. 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]
4. 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]
5. 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]
6. 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]
7. 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]
8. Improved heuristics for minimum-flip supertree construction.
Chen D; Eulenstein O; Fernández-Baca D; Burleigh JG
Evol Bioinform Online; 2007 Feb; 2():347-56. PubMed ID: 19455229
[TBL] [Abstract][Full Text] [Related]
9. Complete generic-level phylogenetic analyses of palms (Arecaceae) with comparisons of supertree and supermatrix approaches.
Baker WJ; Savolainen V; Asmussen-Lange CB; Chase MW; Dransfield J; Forest F; Harley MM; Uhl NW; Wilkinson M
Syst Biol; 2009 Apr; 58(2):240-56. PubMed ID: 20525581
[TBL] [Abstract][Full Text] [Related]
10. MRL and SuperFine+MRL: new supertree methods.
Nguyen N; Mirarab S; Warnow T
Algorithms Mol Biol; 2012 Jan; 7(1):3. PubMed ID: 22280525
[TBL] [Abstract][Full Text] [Related]
11. A simulation study comparing supertree and combined analysis methods using SMIDGen.
Swenson MS; Barbançon F; Warnow T; Linder CR
Algorithms Mol Biol; 2010 Jan; 5():8. PubMed ID: 20047664
[TBL] [Abstract][Full Text] [Related]
12. The shape of supertrees to come: tree shape related properties of fourteen supertree methods.
Wilkinson M; Cotton JA; Creevey C; Eulenstein O; Harris SR; Lapointe FJ; Levasseur C; McInerney JO; Pisani D; Thorley JL
Syst Biol; 2005 Jun; 54(3):419-31. PubMed ID: 16012108
[TBL] [Abstract][Full Text] [Related]
13. PhySIC: a veto supertree method with desirable properties.
Ranwez V; Berry V; Criscuolo A; Fabre PH; Guillemot S; Scornavacca C; Douzery EJ
Syst Biol; 2007 Oct; 56(5):798-817. PubMed ID: 17918032
[TBL] [Abstract][Full Text] [Related]
14. Split-based computation of majority-rule supertrees.
Kupczok A
BMC Evol Biol; 2011 Jul; 11():205. PubMed ID: 21752249
[TBL] [Abstract][Full Text] [Related]
15. Assessment of the accuracy of matrix representation with parsimony analysis supertree construction.
Bininda-Emonds OR; Sanderson MJ
Syst Biol; 2001 Aug; 50(4):565-79. PubMed ID: 12116654
[TBL] [Abstract][Full Text] [Related]
16. Novel versus unsupported clades: assessing the qualitative support for clades in MRP supertrees.
Bininda-Emonds OR
Syst Biol; 2003 Dec; 52(6):839-48. PubMed ID: 14668120
[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. An experimental study of Quartets MaxCut and other supertree methods.
Swenson MS; Suri R; Linder CR; Warnow T
Algorithms Mol Biol; 2011 Apr; 6():7. PubMed ID: 21504600
[TBL] [Abstract][Full Text] [Related]
19. 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]
20. Collecting reliable clades using the Greedy Strict Consensus Merger.
Fleischauer M; Böcker S
PeerJ; 2016; 4():e2172. PubMed ID: 27375971
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
