DupTree: a program for large-scale phylogenetic analyses using gene tree parsimony A Wehe, MS Bansal, JG Burleigh, O Eulenstein Bioinformatics 24 (13), 1540-1541, 2008 | 174 | 2008 |
Genome-scale phylogenetics: inferring the plant tree of life from 18,896 gene trees JG Burleigh, MS Bansal, O Eulenstein, S Hartmann, A Wehe, TJ Vision Systematic Biology 60 (2), 117-125, 2011 | 142 | 2011 |
Obtaining maximal concatenated phylogenetic data sets from large sequence databases MJ Sanderson, AC Driskell, RH Ree, O Eulenstein, S Langley Molecular biology and evolution 20 (7), 1036-1042, 2003 | 140 | 2003 |
The shape of supertrees to come: tree shape related properties of fourteen supertree methods M Wilkinson, JA Cotton, C Creevey, O Eulenstein, SR Harris, FJ Lapointe, ... Systematic biology 54 (3), 419-431, 2005 | 122 | 2005 |
Robinson-foulds supertrees MS Bansal, JG Burleigh, O Eulenstein, D Fernández-Baca Algorithms for molecular biology 5, 1-12, 2010 | 119 | 2010 |
iGTP: a software package for large-scale gene tree parsimony analysis R Chaudhary, MS Bansal, A Wehe, D Fernández-Baca, O Eulenstein BMC bioinformatics 11, 1-7, 2010 | 103 | 2010 |
Towards detection of orthologues in sequence databases. YP Yuan, O Eulenstein, M Vingron, P Bork Bioinformatics (Oxford, England) 14 (3), 285-289, 1998 | 93 | 1998 |
Performance of flip supertree construction with a heuristic algorithm O Eulenstein, D Chen, JG Burleigh, D Fernández-Baca, MJ Sanderson Systematic Biology 53 (2), 299-308, 2004 | 86 | 2004 |
Flipping: a supertree construction method D Chen, L Diao, O Eulenstein, D Fernández-Baca, M Sanderson DIMACS series in discrete mathematics and theoretical computer science 61 …, 2003 | 76 | 2003 |
Duplication-based measures of difference between gene and species trees O Eulenstein, B Mirkin, M Vingron Journal of Computational Biology 5 (1), 135-148, 1998 | 73 | 1998 |
Efficient genome-scale phylogenetic analysis under the duplication-loss and deep coalescence cost models MS Bansal, JG Burleigh, O Eulenstein BMC bioinformatics 11, 1-9, 2010 | 67 | 2010 |
Heuristics for the Gene-Duplication Problem: A Θ(n) Speed-Up for the Local Search MS Bansal, JG Burleigh, O Eulenstein, A Wehe Research in Computational Molecular Biology: 11th Annual International …, 2007 | 64 | 2007 |
Quartet supertrees R Piaggio-Talice, JG Burleigh, O Eulenstein Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life …, 2004 | 61 | 2004 |
Reconciling gene trees with apparent polytomies WC Chang, O Eulenstein International Computing and Combinatorics Conference, 235-244, 2006 | 58 | 2006 |
Minimum-flip supertrees: complexity and algorithms D Chen, O Eulenstein, D Fernandez-Baca, M Sanderson IEEE/ACM transactions on computational biology and bioinformatics 3 (2), 165-173, 2006 | 58 | 2006 |
The multiple gene duplication problem revisited MS Bansal, O Eulenstein Bioinformatics 24 (13), i132-i138, 2008 | 54 | 2008 |
Improved heuristics for minimum-flip supertree construction D Chen, O Eulenstein, D Fernández-Baca, JG Burleigh Evolutionary Bioinformatics 2, 117693430600200003, 2006 | 54 | 2006 |
10 Reconciling Phylogenetic Trees O Eulenstein, S Huzurbazar, DA Liberles Evolution after gene duplication, 185, 2011 | 53 | 2011 |
Identifying optimal incomplete phylogenetic data sets from sequence databases C Yan, JG Burleigh, O Eulenstein Molecular phylogenetics and evolution 35 (3), 528-535, 2005 | 53 | 2005 |
Unrooted tree reconciliation: A unified approach P Górecki, O Eulenstein, J Tiuryn IEEE/ACM transactions on computational biology and bioinformatics 10 (2 …, 2013 | 48 | 2013 |