 | 2012 |
| 34 |  | Pawel Górecki,
J. Gordon Burleigh,
Oliver Eulenstein:
GTP Supertrees from Unrooted Gene Trees: Linear Time Algorithms for NNI Based Local Searches.
ISBRA 2012: 102-114 |
| 33 |  | Pawel Górecki,
Oliver Eulenstein:
A Robinson-Foulds Measure to Compare Unrooted Trees with Rooted Trees.
ISBRA 2012: 115-126 |
| 32 |  | André Wehe,
J. Gordon Burleigh,
Oliver Eulenstein:
Algorithms for Knowledge-Enhanced Supertrees.
ISBRA 2012: 263-274 |
| 2011 |
| 31 |  | Oliver Eulenstein:
Invited: Reconciled gene trees and their applications.
ICCABS 2011: 6 |
| 30 |  | Pawel Górecki,
Oliver Eulenstein:
A Linear Time Algorithm for Error-Corrected Reconciliation of Unrooted Gene Trees.
ISBRA 2011: 148-159 |
| 29 |  | Harris T. Lin,
J. Gordon Burleigh,
Oliver Eulenstein:
The Deep Coalescence Consensus Tree Problem is Pareto on Clusters.
ISBRA 2011: 172-183 |
| 28 |  | Ruchi Chaudhary,
J. Gordon Burleigh,
Oliver Eulenstein:
Algorithms for Rapid Error Correction for the Gene Duplication Problem.
ISBRA 2011: 227-239 |
| 27 |  | Wen-Chieh Chang,
Sudheer Vakati,
Roland Krause,
Oliver Eulenstein:
Mining Biological Interaction Networks Using Weighted Quasi-Bicliques.
ISBRA 2011: 428-439 |
| 26 |  | John Wiedenhoeft,
Roland Krause,
Oliver Eulenstein:
The Plexus Model for the Inference of Ancestral Multidomain Proteins.
IEEE/ACM Trans. Comput. Biology Bioinform. 8(4): 890-901 (2011) |
| 2010 |
| 25 |  | J. Gordon Burleigh,
Mukul S. Bansal,
Oliver Eulenstein,
Todd J. Vision:
Inferring species trees from gene duplication episodes.
BCB 2010: 198-203 |
| 24 |  | Max Homilius,
John Gordon Burleigh,
Oliver Eulenstein:
Triplet-Supertrees constructed from Minimum Triplet Presentations.
BICoB 2010: 127-132 |
| 23 |  | John Wiedenhoeft,
Roland Krause,
Oliver Eulenstein:
Inferring Evolutionary Scenarios for Protein Domain Compositions.
ISBRA 2010: 179-190 |
| 22 |  | Mukul S. Bansal,
J. Gordon Burleigh,
Oliver Eulenstein:
Efficient genome-scale phylogenetic analysis under the duplication-loss and deep coalescence cost models.
BMC Bioinformatics 11(S-1): 42 (2010) |
| 21 |  | Ruchi Chaudhary,
Mukul S. Bansal,
André Wehe,
David Fernández-Baca,
Oliver Eulenstein:
iGTP: A software package for large-scale gene tree parsimony analysis.
BMC Bioinformatics 11: 574 (2010) |
| 20 |  | André Wehe,
Wen-Chieh Chang,
Oliver Eulenstein,
Srinivas Aluru:
A scalable parallelization of the gene duplication problem.
J. Parallel Distrib. Comput. 70(3): 237-244 (2010) |
| 2009 |
| 19 |  | Mukul S. Bansal,
Wen-Chieh Chang,
Oliver Eulenstein,
David Fernández-Baca:
Generalized Binary Tanglegrams: Algorithms and Applications.
BICoB 2009: 114-125 |
| 18 |  | Harris T. Lin,
J. Gordon Burleigh,
Oliver Eulenstein:
Triplet supertree heuristics for the tree of life.
BMC Bioinformatics 10(S-1): (2009) |
| 17 |  | Mukul S. Bansal,
Oliver Eulenstein,
André Wehe:
The Gene-Duplication Problem: Near-Linear Time Algorithms for NNI-Based Local Searches.
IEEE/ACM Trans. Comput. Biology Bioinform. 6(2): 221-231 (2009) |
| 2008 |
| 16 |  | Mukul S. Bansal,
Oliver Eulenstein:
The Gene-Duplication Problem: Near-Linear Time Algorithms for NNI Based Local Searches.
ISBRA 2008: 14-25 |
| 15 |  | Mukul S. Bansal,
Oliver Eulenstein:
The multiple gene duplication problem revisited.
ISMB 2008: 132-138 |
| 14 |  | J. Gordon Burleigh,
Mukul S. Bansal,
André Wehe,
Oliver Eulenstein:
Locating Multiple Gene Duplications through Reconciled Trees.
RECOMB 2008: 273-284 |
| 13 |  | André Wehe,
Mukul S. Bansal,
J. Gordon Burleigh,
Oliver Eulenstein:
DupTree: a program for large-scale phylogenetic analyses using gene tree parsimony.
Bioinformatics 24(13): 1540-1541 (2008) |
| 12 |  | Mukul S. Bansal,
Oliver Eulenstein:
An Omega(n^2/ log n) Speed-Up of TBR Heuristics for the Gene-Duplication Problem.
IEEE/ACM Trans. Comput. Biology Bioinform. 5(4): 514-524 (2008) |
| 2007 |
| 11 |  | Mukul S. Bansal,
J. Gordon Burleigh,
Oliver Eulenstein,
André Wehe:
Heuristics for the Gene-Duplication Problem: A Theta ( n ) Speed-Up for the Local Search.
RECOMB 2007: 238-252 |
| 10 |  | Mukul S. Bansal,
Oliver Eulenstein:
An Omega(n2/log n) Speed-Up of TBR Heuristics for the Gene-Duplication Problem.
WABI 2007: 124-135 |
| 2006 |
| 9 |  | Wen-Chieh Chang,
Oliver Eulenstein:
Reconciling Gene Trees with Apparent Polytomies.
COCOON 2006: 235-244 |
| 8 |  | Duhong Chen,
Oliver Eulenstein,
David Fernández-Baca,
Michael Sanderson:
Minimum-Flip Supertrees: Complexity and Algorithms.
IEEE/ACM Trans. Comput. Biology Bioinform. 3(2): 165-173 (2006) |
| 2004 |
| 7 |  | Duhong Chen,
Oliver Eulenstein,
David Fernández-Baca:
Rainbow: a toolbox for phylogenetic supertree construction and analysis.
Bioinformatics 20(16): 2872-2873 (2004) |
| 2002 |
| 6 |  | Duhong Chen,
Oliver Eulenstein,
David Fernández-Baca,
Michael Sanderson:
Supertrees by Flipping.
COCOON 2002: 391-400 |
| 5 |  | J. Schonfeld,
Oliver Eulenstein,
Kent Vander Velden,
Gavin J. P. Naylor:
Investigating Evolutionary Lines of Least Resistance Using the Inverse Protein-Folding Problem.
Pacific Symposium on Biocomputing 2002: 613-624 |
| 1998 |
| 4 |  | Yan P. Yuan,
Oliver Eulenstein,
Martin Vingron,
Peer Bork:
Towards detection of orthologues in sequence databases.
Bioinformatics 14(3): 285-289 (1998) |
| 3 |  | Oliver Eulenstein,
Martin Vingron:
On the Equivalence of Two Tree Mapping Measures.
Discrete Applied Mathematics 88(1-3): 103-128 (1998) |
| 2 |  | Oliver Eulenstein,
Boris Mirkin,
Martin Vingron:
Duplication-Based Measures of Difference Between Gene and Species Trees.
Journal of Computational Biology 5(1): 135-148 (1998) |
| 1997 |
| 1 |  | Yan P. Yuan,
Oliver Eulenstein,
Martin Vingron,
Peer Bork:
Towards detection of sequence orthologs.
German Conference on Bioinformatics 1997: 25-30 |