| 2009 |
|---|
| 17 | EE | Mukul S. Bansal,
Wen-Chieh Chang,
Oliver Eulenstein,
David Fernández-Baca:
Generalized Binary Tanglegrams: Algorithms and Applications.
BICoB 2009: 114-125 |
| 2008 |
|---|
| 16 | EE | Mukul S. Bansal,
Oliver Eulenstein:
The Gene-Duplication Problem: Near-Linear Time Algorithms for NNI Based Local Searches.
ISBRA 2008: 14-25 |
| 15 | EE | Mukul S. Bansal,
Oliver Eulenstein:
The multiple gene duplication problem revisited.
ISMB 2008: 132-138 |
| 14 | EE | J. Gordon Burleigh,
Mukul S. Bansal,
André Wehe,
Oliver Eulenstein:
Locating Multiple Gene Duplications through Reconciled Trees.
RECOMB 2008: 273-284 |
| 13 | EE | 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 | EE | 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 | EE | 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 | EE | 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 | EE | Wen-Chieh Chang,
Oliver Eulenstein:
Reconciling Gene Trees with Apparent Polytomies.
COCOON 2006: 235-244 |
| 8 | EE | 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 | EE | 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 | EE | Duhong Chen,
Oliver Eulenstein,
David Fernández-Baca,
Michael Sanderson:
Supertrees by Flipping.
COCOON 2002: 391-400 |
| 5 | EE | 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 | EE | 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 |
