Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Oliver
    Last name: Eulenstein
    DBLP: 96/3333
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 43 of 43  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Pawel Górecki, Oliver Eulenstein.
    A Robinson-Foulds Measure to Compare Unrooted Trees with Rooted Trees.
    Bioinformatics Research and Applications - 8th International Symposium, ISBRA 2012, Dallas, TX, USA, May 21-23, 2012. Proceedings 2012 (0) 2012
    Conference paper
    André Wehe, John Gordon Burleigh, Oliver Eulenstein.
    Algorithms for Knowledge-Enhanced Supertrees.
    Bioinformatics Research and Applications - 8th International Symposium, ISBRA 2012, Dallas, TX, USA, May 21-23, 2012. Proceedings 2012 (0) 2012
    Conference paper
    Pawel Górecki, John Gordon Burleigh, Oliver Eulenstein.
    GTP Supertrees from Unrooted Gene Trees: Linear Time Algorithms for NNI Based Local Searches.
    Bioinformatics Research and Applications - 8th International Symposium, ISBRA 2012, Dallas, TX, USA, May 21-23, 2012. Proceedings 2012 (0) 2012
    Conference paper
    Pawel Górecki, Oliver Eulenstein.
    Deep Coalescence Reconciliation with Unrooted Gene Trees: Linear Time Algorithms.
    Computing and Combinatorics - 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012. Proceedings 2012 (0) 2012
    Journal article
    Ruchi Chaudhary, John Gordon Burleigh, Oliver Eulenstein.
    Efficient error correction algorithms for gene tree reconciliation based on duplication, duplication and loss, and deep coalescence.
    BMC Bioinformatics 2012, Volume 13 (0) 2012
    Journal article
    Pawel Górecki, Oliver Eulenstein.
    Algorithms: simultaneous error-correction and rooting for gene tree reconciliation and the gene duplication problem.
    BMC Bioinformatics 2012, Volume 13 (0) 2012
    Journal article
    Wen-Chieh Chang 0002, Sudheer Vakati, Roland Krause, Oliver Eulenstein.
    Exploring biological interaction networks with tailored weighted quasi-bicliques.
    BMC Bioinformatics 2012, Volume 13 (0) 2012
    Journal article
    Harris T. Lin, John Gordon Burleigh, Oliver Eulenstein.
    Consensus properties for the deep coalescence problem and their application for scalable tree search.
    BMC Bioinformatics 2012, Volume 13 (0) 2012
    Conference paper
    Ruchi Chaudhary, John Gordon Burleigh, Oliver Eulenstein.
    Algorithms for Rapid Error Correction for the Gene Duplication Problem.
    Bioinformatics Research and Applications - 7th International Symposium, ISBRA 2011, Changsha, China, May 27-29, 2011. Proceedings 2011 (0) 2011
    Conference paper
    Pawel Górecki, Oliver Eulenstein.
    A Linear Time Algorithm for Error-Corrected Reconciliation of Unrooted Gene Trees.
    Bioinformatics Research and Applications - 7th International Symposium, ISBRA 2011, Changsha, China, May 27-29, 2011. Proceedings 2011 (0) 2011
    Conference paper
    Wen-Chieh Chang, Sudheer Vakati, Roland Krause, Oliver Eulenstein.
    Mining Biological Interaction Networks Using Weighted Quasi-Bicliques.
    Bioinformatics Research and Applications - 7th International Symposium, ISBRA 2011, Changsha, China, May 27-29, 2011. Proceedings 2011 (0) 2011
    Conference paper
    Harris T. Lin, John Gordon Burleigh, Oliver Eulenstein.
    The Deep Coalescence Consensus Tree Problem is Pareto on Clusters.
    Bioinformatics Research and Applications - 7th International Symposium, ISBRA 2011, Changsha, China, May 27-29, 2011. Proceedings 2011 (0) 2011
    Conference paper
    John Wiedenhoeft, Roland Krause, Oliver Eulenstein.
    The Plexus Model for the Inference of Ancestral Multidomain Proteins.
    IEEE/ACM Trans. Comput. Biology Bioinform. 2011, Volume 8 (0) 2011
    Conference paper
    Oliver Eulenstein.
    Invited: Reconciled gene trees and their applications.
    IEEE 1st International Conference on Computational Advances in Bio and Medical Sciences, ICCABS 2011, Orlando, FL, USA, February 3-5, 2011 2011 (0) 2011
    Journal article
    Pawel Górecki, John Gordon Burleigh, Oliver Eulenstein.
    Maximum likelihood models and algorithms for gene tree evolution with duplications and losses.
    BMC Bioinformatics 2011, Volume 12 (0) 2011
    Journal article
    Wen-Chieh Chang 0002, John Gordon Burleigh, David Fernández-Baca, Oliver Eulenstein.
    An ILP solution for the gene duplication problem.
    BMC Bioinformatics 2011, Volume 12 (0) 2011
    Conference paper
    Max Homilius, John Gordon Burleigh, Oliver Eulenstein.
    Triplet-Supertrees constructed from Minimum Triplet Presentations.
    Proceedings of the ISCA 2nd International Conference on Bioinformatics and Computational Biology, BICoB-2010, March 24-26, 2010, Sheraton Waikiki Hotel, Honolulu, Hawaii, USA 2010 (0) 2010
    Journal article
    Mukul S. Bansal, John Gordon Burleigh, Oliver Eulenstein.
    Efficient genome-scale phylogenetic analysis under the duplication-loss and deep coalescence cost models.
    BMC Bioinformatics 2010, Volume 11 (0) 2010
    Conference paper
    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 2010, Volume 11 (0) 2010
    Conference paper
    John Gordon Burleigh, Mukul S. Bansal, Oliver Eulenstein, Todd J. Vision.
    Inferring species trees from gene duplication episodes.
    Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology, BCB 2010, Niagara Falls, NY, USA, August 2-4, 2010 2010 (0) 2010
    Journal article
    Mukul S. Bansal, John Gordon Burleigh, Oliver Eulenstein, David Fernández-Baca.
    Robinson-Foulds Supertrees.
    Algorithms for Molecular Biology 2010, Volume 5 (0) 2010
    Conference paper
    André Wehe, Wen-Chieh Chang, Oliver Eulenstein, Srinivas Aluru.
    A scalable parallelization of the gene duplication problem.
    J. Parallel Distrib. Comput. 2010, Volume 70 (0) 2010
    Conference paper
    John Wiedenhoeft, Roland Krause, Oliver Eulenstein.
    Inferring Evolutionary Scenarios for Protein Domain Compositions.
    Bioinformatics Research and Applications, 6th International Symposium, ISBRA 2010, Storrs, CT, USA, May 23-26, 2010. Proceedings 2010 (0) 2010
    Journal article
    John Gordon Burleigh, Mukul S. Bansal, André Wehe, Oliver Eulenstein.
    Locating Large-Scale Gene Duplication Events through Reconciled Trees: Implications for Identifying Ancient Polyploidy Events in Plants.
    Journal of Computational Biology 2009, Volume 16 (0) 2009
    Conference paper
    Mukul S. Bansal, Wen-Chieh Chang 0002, Oliver Eulenstein, David Fernández-Baca.
    Generalized Binary Tanglegrams: Algorithms and Applications.
    Bioinformatics and Computational Biology, First International Conference, BICoB 2009, New Orleans, LA, USA, April 8-10, 2009. Proceedings 2009 (0) 2009
    Conference paper
    Harris T. Lin, John Gordon Burleigh, Oliver Eulenstein.
    Triplet supertree heuristics for the tree of life.
    BMC Bioinformatics 2009, Volume 10 (0) 2009
    Conference paper
    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. 2009, Volume 6 (0) 2009
    Conference paper
    Mukul S. Bansal, Oliver Eulenstein.
    The multiple gene duplication problem revisited.
    Proceedings 16th International Conference on Intelligent Systems for Molecular Biology (ISMB), Toronto, Canada, July 19-23, 2008 2008 (0) 2008
    Conference paper
    John Gordon Burleigh, Mukul S. Bansal, André Wehe, Oliver Eulenstein.
    Locating Multiple Gene Duplications through Reconciled Trees.
    Research in Computational Molecular Biology, 12th Annual International Conference, RECOMB 2008, Singapore, March 30 - April 2, 2008. Proceedings 2008 (0) 2008
    Conference paper
    Mukul S. Bansal, Oliver Eulenstein.
    The Gene-Duplication Problem: Near-Linear Time Algorithms for NNI Based Local Searches.
    Bioinformatics Research and Applications, Fourth International Symposium, ISBRA 2008, Atlanta, GA, USA, May 6-9, 2008. Proceedings 2008 (0) 2008
    Conference paper
    André Wehe, Mukul S. Bansal, John Gordon Burleigh, Oliver Eulenstein.
    DupTree: a program for large-scale phylogenetic analyses using gene tree parsimony.
    Bioinformatics 2008, Volume 24 (0) 2008
    Conference paper
    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. 2008, Volume 5 (0) 2008
    Conference paper
    Mukul S. Bansal, John Gordon Burleigh, Oliver Eulenstein, André Wehe.
    Heuristics for the Gene-Duplication Problem: A
    Research in Computational Molecular Biology, 11th Annual International Conference, RECOMB 2007, Oakland, CA, USA, April 21-25, 2007, Proceedings 2007 (0) 2007
    Conference paper
    Mukul S. Bansal, Oliver Eulenstein.
    An
    Algorithms in Bioinformatics, 7th International Workshop, WABI 2007, Philadelphia, PA, USA, September 8-9, 2007, Proceedings 2007 (0) 2007
    Conference paper
    Wen-Chieh Chang 0002, Oliver Eulenstein.
    Reconciling Gene Trees with Apparent Polytomies.
    Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings 2006 (0) 2006
    Conference paper
    Duhong Chen, Oliver Eulenstein, David Fernández-Baca, Michael Sanderson.
    Minimum-Flip Supertrees: Complexity and Algorithms.
    IEEE/ACM Trans. Comput. Biology Bioinform. 2006, Volume 3 (0) 2006
    Conference paper
    Duhong Chen, Oliver Eulenstein, David Fernández-Baca.
    Rainbow: a toolbox for phylogenetic supertree construction and analysis.
    Bioinformatics 2004, Volume 20 (0) 2004
    Conference paper
    Duhong Chen, Oliver Eulenstein, David Fernández-Baca, Michael Sanderson.
    Supertrees by Flipping.
    Computing and Combinatorics, 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002, Proceedings 2002 (0) 2002
    Conference paper
    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 (0) 2002
    Conference paper
    Yan P. Yuan, Oliver Eulenstein, Martin Vingron, Peer Bork.
    Towards detection of orthologues in sequence databases.
    Bioinformatics 1998, Volume 14 (0) 1998
    Conference paper
    Oliver Eulenstein, Martin Vingron.
    On the Equivalence of Two Tree Mapping Measures.
    Discrete Applied Mathematics 1998, Volume 88 (0) 1998
    Conference paper
    Oliver Eulenstein, Boris Mirkin, Martin Vingron.
    Duplication-Based Measures of Difference Between Gene and Species Trees.
    Journal of Computational Biology 1998, Volume 5 (0) 1998
    Conference paper
    Yan P. Yuan, Oliver Eulenstein, Martin Vingron, Peer Bork.
    Towards detection of sequence orthologs.
    German Conference on Bioinformatics 1997 (0) 1997
    Show item 1 to 25 of 43  

    Your query returned 43 matches in the database.