177 related articles for article (PubMed ID: 26357270)
1. 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]
2. 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]
3. 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]
4. 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]
5. 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]
6. 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]
7. 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]
8. 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]
9. 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]
10. Split-based computation of majority-rule supertrees.
Kupczok A
BMC Evol Biol; 2011 Jul; 11():205. PubMed ID: 21752249
[TBL] [Abstract][Full Text] [Related]
11. 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]
12. Minimum-flip supertrees: complexity and algorithms.
Chen D; Eulenstein O; Fernandez-Baca D; Sanderson M
IEEE/ACM Trans Comput Biol Bioinform; 2006; 3(2):165-73. PubMed ID: 17048402
[TBL] [Abstract][Full Text] [Related]
13. 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]
14. 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]
15. 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]
16. 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]
17. 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]
18. Fixed-parameter tractability of the maximum agreement supertree problem.
Guillemot S; Berry V
IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(2):342-53. PubMed ID: 20431153
[TBL] [Abstract][Full Text] [Related]
19. 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]
20. 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]
[Next] [New Search]