167 related articles for article (PubMed ID: 9773340)
1. Better methods for solving parsimony and compatibility.
Bonet M; Steel M; Warnow T; Yooseph S
J Comput Biol; 1998; 5(3):391-407. PubMed ID: 9773340
[TBL] [Abstract][Full Text] [Related]
2. Towards improving searches for optimal phylogenies.
Ford E; St John K; Wheeler WC
Syst Biol; 2015 Jan; 64(1):56-65. PubMed ID: 25164916
[TBL] [Abstract][Full Text] [Related]
3. Merging Partially Labelled Trees: Hardness and a Declarative Programming Solution.
Labarre A; Verwer S
IEEE/ACM Trans Comput Biol Bioinform; 2014; 11(2):389-97. PubMed ID: 26355785
[TBL] [Abstract][Full Text] [Related]
4. DTL reconciliation repair.
Ma W; Smirnov D; Libeskind-Hadas R
BMC Bioinformatics; 2017 Mar; 18(Suppl 3):76. PubMed ID: 28361686
[TBL] [Abstract][Full Text] [Related]
5. 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]
6. 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]
7. Maximum likelihood of evolutionary trees: hardness and approximation.
Chor B; Tuller T
Bioinformatics; 2005 Jun; 21 Suppl 1():i97-106. PubMed ID: 15961504
[TBL] [Abstract][Full Text] [Related]
8. DTL-RnB: Algorithms and Tools for Summarizing the Space of DTL Reconciliations.
Ma W; Smirnov D; Forman J; Schweickart A; Slocum C; Srinivasan S; Libeskind-Hadas R
IEEE/ACM Trans Comput Biol Bioinform; 2018; 15(2):411-421. PubMed ID: 26955051
[TBL] [Abstract][Full Text] [Related]
9. Efficient algorithms for knowledge-enhanced supertree and supermatrix phylogenetic problems.
Wehe A; Burleigh JG; Eulenstein O
IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(6):1432-41. PubMed ID: 24407302
[TBL] [Abstract][Full Text] [Related]
10. Reconstructing ancestral genomic sequences by co-evolution: formal definitions, computational issues, and biological examples.
Tuller T; Birin H; Kupiec M; Ruppin E
J Comput Biol; 2010 Sep; 17(9):1327-44. PubMed ID: 20874411
[TBL] [Abstract][Full Text] [Related]
11. Hide and vanish: data sets where the most parsimonious tree is known but hard to find, and their implications for tree search methods.
Goloboff PA
Mol Phylogenet Evol; 2014 Oct; 79():118-31. PubMed ID: 24952317
[TBL] [Abstract][Full Text] [Related]
12. 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]
13. A fast algorithm for computing geodesic distances in tree space.
Owen M; Provan JS
IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(1):2-13. PubMed ID: 21071792
[TBL] [Abstract][Full Text] [Related]
14. 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]
15. Using tree diversity to compare phylogenetic heuristics.
Sul SJ; Matthews S; Williams TL
BMC Bioinformatics; 2009 Apr; 10 Suppl 4(Suppl 4):S3. PubMed ID: 19426451
[TBL] [Abstract][Full Text] [Related]
16. Phylogeny inference based on spectral graph clustering.
Zhang SB; Zhou SY; He JG; Lai JH
J Comput Biol; 2011 Apr; 18(4):627-37. PubMed ID: 21352066
[TBL] [Abstract][Full Text] [Related]
17. Maximum parsimony for tree mixtures.
Grünewald S; Moulton V
IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(1):97-102. PubMed ID: 19179702
[TBL] [Abstract][Full Text] [Related]
18. 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]
19. Co-divergence and tree topology.
Calamoneri T; Monti A; Sinaimeri B
J Math Biol; 2019 Aug; 79(3):1149-1167. PubMed ID: 31203388
[TBL] [Abstract][Full Text] [Related]
20. Measuring inconsistency in phylogenetic trees.
Willson SJ
J Theor Biol; 1998 Jan; 190(1):15-36. PubMed ID: 9473388
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
