198 related articles for article (PubMed ID: 28650824)
1. Computing Manhattan Path-Difference Median Trees: A Practical Local Search Approach.
Markin A; Eulenstein O
IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(4):1063-1076. PubMed ID: 28650824
[TBL] [Abstract][Full Text] [Related]
2. Efficient Local Search for Euclidean Path-Difference Median Trees.
Markin A; Eulenstein O
IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(4):1374-1385. PubMed ID: 29035224
[TBL] [Abstract][Full Text] [Related]
3. Cophenetic Median Trees.
Markin A; Eulenstein O
IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(5):1459-1470. PubMed ID: 30222583
[TBL] [Abstract][Full Text] [Related]
4. Exact median-tree inference for unrooted reconciliation costs.
Górecki P; Markin A; Eulenstein O
BMC Evol Biol; 2020 Oct; 20(Suppl 1):136. PubMed ID: 33115401
[TBL] [Abstract][Full Text] [Related]
5. 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]
6. Exact solutions for species tree inference from discordant gene trees.
Chang WC; Górecki P; Eulenstein O
J Bioinform Comput Biol; 2013 Oct; 11(5):1342005. PubMed ID: 24131054
[TBL] [Abstract][Full Text] [Related]
7. Consensus of All Solutions for Intractable Phylogenetic Tree Inference.
Tabaszewski P; Gorecki P; Markin A; Anderson T; Eulenstein O
IEEE/ACM Trans Comput Biol Bioinform; 2021; 18(1):149-161. PubMed ID: 31613775
[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. Species tree inference by minimizing deep coalescences.
Than C; Nakhleh L
PLoS Comput Biol; 2009 Sep; 5(9):e1000501. PubMed ID: 19749978
[TBL] [Abstract][Full Text] [Related]
10. 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]
11. 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]
12. 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]
13. A fast tool for minimum hybridization networks.
Chen ZZ; Wang L; Yamanaka S
BMC Bioinformatics; 2012 Jul; 13():155. PubMed ID: 22748099
[TBL] [Abstract][Full Text] [Related]
14. Inferring optimal species trees under gene duplication and loss.
Bayzid MS; Mirarab S; Warnow T
Pac Symp Biocomput; 2013; ():250-61. PubMed ID: 23424130
[TBL] [Abstract][Full Text] [Related]
15. Clearcut: a fast implementation of relaxed neighbor joining.
Sheneman L; Evans J; Foster JA
Bioinformatics; 2006 Nov; 22(22):2823-4. PubMed ID: 16982706
[TBL] [Abstract][Full Text] [Related]
16. On the elusiveness of clusters.
Kelk SM; Scornavacca C; van Iersel L
IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(2):517-34. PubMed ID: 21968961
[TBL] [Abstract][Full Text] [Related]
17. Comparison of tree-child phylogenetic networks.
Cardona G; Rosselló F; Valiente G
IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(4):552-69. PubMed ID: 19875855
[TBL] [Abstract][Full Text] [Related]
18. Inferring Trees.
Whelan S; Morrison DA
Methods Mol Biol; 2017; 1525():349-377. PubMed ID: 27896728
[TBL] [Abstract][Full Text] [Related]
19. 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]
20. The gene-duplication problem: near-linear time algorithms for NNI-based local searches.
Bansal MS; Eulenstein O; Wehe A
IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(2):221-31. PubMed ID: 19407347
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
