186 related articles for article (PubMed ID: 16823581)
1. On the ancestral compatibility of two phylogenetic trees with nested taxa.
Llabrés M; Rocha J; Rosselló F; Valiente G
J Math Biol; 2006 Sep; 53(3):340-64. PubMed ID: 16823581
[TBL] [Abstract][Full Text] [Related]
2. Fast computation of supertrees for compatible phylogenies with nested taxa.
Berry V; Semple C
Syst Biol; 2006 Apr; 55(2):270-88. PubMed ID: 16611599
[TBL] [Abstract][Full Text] [Related]
3. Supertree algorithms for ancestral divergence dates and nested taxa.
Semple C; Daniel P; Hordijk W; Page RD; Steel M
Bioinformatics; 2004 Oct; 20(15):2355-60. PubMed ID: 15073021
[TBL] [Abstract][Full Text] [Related]
4. 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]
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. Amalgamating source trees with different taxonomic levels.
Berry V; Bininda-Emonds OR; Semple C
Syst Biol; 2013 Mar; 62(2):231-49. PubMed ID: 23179602
[TBL] [Abstract][Full Text] [Related]
7. 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]
8. 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]
9. Split-based computation of majority-rule supertrees.
Kupczok A
BMC Evol Biol; 2011 Jul; 11():205. PubMed ID: 21752249
[TBL] [Abstract][Full Text] [Related]
10. When is a Phylogenetic Network Simply an Amalgamation of Two Trees?
Semple C; Simpson J
Bull Math Biol; 2018 Sep; 80(9):2338-2348. PubMed ID: 29981001
[TBL] [Abstract][Full Text] [Related]
11. 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]
12. Trees from trees: construction of phylogenetic supertrees using clann.
Creevey CJ; McInerney JO
Methods Mol Biol; 2009; 537():139-61. PubMed ID: 19378143
[TBL] [Abstract][Full Text] [Related]
13. An efficient algorithm for testing the compatibility of phylogenies with nested taxa.
Deng Y; Fernández-Baca D
Algorithms Mol Biol; 2017; 12():7. PubMed ID: 28331536
[TBL] [Abstract][Full Text] [Related]
14. 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]
15. Refining phylogenetic trees given additional data: an algorithm based on parsimony.
Wu T; Moulton V; Steel M
IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(1):118-25. PubMed ID: 19179705
[TBL] [Abstract][Full Text] [Related]
16. GPTree Cluster: phylogenetic tree cluster generator in the context of supertree inference.
Koshkarov A; Tahiri N
Bioinform Adv; 2023; 3(1):vbad023. PubMed ID: 37056516
[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. SuperFine: fast and accurate supertree estimation.
Swenson MS; Suri R; Linder CR; Warnow T
Syst Biol; 2012 Mar; 61(2):214-27. PubMed ID: 21934137
[TBL] [Abstract][Full Text] [Related]
19. 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]
20. Assessing clustering results with reference taxonomies.
Valiente G
Genome Inform; 2006; 17(2):131-40. PubMed ID: 17503386
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
