Oliver Eulenstein

ORCID

Publication Activity (10 Years)

Years Active: 1996-2024
Publications (10 Years): 42

Top Venues

IEEE ACM Trans. Comput. Biol. Bioinform.

BCB

J. Bioinform. Comput. Biol.

ISBRA

Publications

Sanket Wagle, Alexey Markin, Pawel Górecki, Tavis K. Anderson, Oliver Eulenstein
Asymmetric Cluster-Based Measures for Comparative Phylogenetics. J. Comput. Biol. 31 (4) (2024)
Adithya Kulkarni, Oliver Eulenstein, Qi Li
Empirical Analysis for Unsupervised Universal Dependency Parse Tree Aggregation. CoRR (2024)
Siddhant Grover, Alexey Markin, Tavis K. Anderson, Oliver Eulenstein
Phylogenetic diversity statistics for all clades in a phylogeny. Bioinform. 39 (Supplement-1) (2023)
Sanket Wagle, Alexey Markin, Pawel Górecki, Tavis K. Anderson, Oliver Eulenstein
The Asymmetric Cluster Affinity Cost. RECOMB-CG (2023)
Adithya Kulkarni, Nasim Sabetpour, Alexey Markin, Oliver Eulenstein, Qi Li
CPTAM: Constituency Parse Tree Aggregation Method. CoRR (2022)
Alvin Chon, Pawel Górecki, Oliver Eulenstein, Xiaoqiu Huang, Ali Jannesari
Scalable and Extensible Robinson-Foulds for Comparative Phylogenetics. IPDPS Workshops (2022)
Adithya Kulkarni, Nasim Sabetpour, Alexey Markin, Oliver Eulenstein, Qi Li
CPTAM: Constituency Parse Tree Aggregation Method. SDM (2022)
Alexey Markin, Sanket Wagle, Tavis K. Anderson, Oliver Eulenstein
RF-Net 2: fast inference of virus reassortment and hybridization networks. Bioinform. 38 (8) (2022)
Alexey Markin, Oliver Eulenstein
Quartet-based inference is statistically consistent under the unified duplication-loss-coalescence model. Bioinform. 37 (22) (2021)
Pawel Tabaszewski, Pawel Górecki, Alexey Markin, Tavis K. Anderson, Oliver Eulenstein
Consensus of All Solutions for Intractable Phylogenetic Tree Inference. IEEE ACM Trans. Comput. Biol. Bioinform. 18 (1) (2021)
Jaroslaw Paszek, Oliver Eulenstein, Pawel Górecki
Novel genomic duplication models through integer linear programming. BCB (2021)
Pawel Górecki, Oliver Eulenstein, Jerzy Tiuryn
The Unconstrained Diameters of the Duplication-Loss Cost and the Loss Cost. IEEE ACM Trans. Comput. Biol. Bioinform. 18 (6) (2021)
Oliver Eulenstein, Qin Ding, Hisham Al-Mubaid
Introduction to the JBCB Special Issue on Selected Papers from BICOB-2020. J. Bioinform. Comput. Biol. 19 (1) (2021)
Jaroslaw Paszek, Alexey Markin, Pawel Górecki, Oliver Eulenstein
Taming the Duplication-Loss-Coalescence Model with Integer Linear Programming. J. Comput. Biol. 28 (8) (2021)
Javad Ansarifar, Alexey Markin, Pawel Górecki, Oliver Eulenstein
Integer Linear Programming Formulation for the Unified Duplication-Loss-Coalescence Model. ISBRA (2020)
Jucheol Moon, Oliver Eulenstein
The Cluster Affinity Distance for Phylogenies. ISBRA (2019)
Huy N. Nguyen, Ashish Jain, Oliver Eulenstein, Iddo Friedberg
Tracing the ancestry of operons in bacteria. Bioinform. 35 (17) (2019)
Alexey Markin, Tavis K. Anderson, Venkata Sai Krishna Teja Vadali, Oliver Eulenstein
Robinson-Foulds Reticulation Networks. BCB (2019)
Pawel Górecki, Agnieszka Mykowiecka, Jaroslaw Paszek, Oliver Eulenstein
Mathematical properties of the gene duplication cost. Discret. Appl. Math. 258 (2019)
Alexey Markin, Oliver Eulenstein
Cophenetic Median Trees. IEEE ACM Trans. Comput. Biol. Bioinform. 16 (5) (2019)
Alexey Markin, Oliver Eulenstein
Consensus Clusters in Robinson-Foulds Reticulation Networks. WABI (2019)
Alexey Markin, Oliver Eulenstein
Efficient Local Search for Euclidean Path-Difference Median Trees. IEEE ACM Trans. Comput. Biol. Bioinform. 16 (4) (2019)
Pawel Górecki, Alexey Markin, Oliver Eulenstein
Feasibility Algorithms for the Duplication-Loss Cost. COCOON (2019)
Qin Ding, Oliver Eulenstein, Hisham Al-Mubaid
Foreword: Special Issue for the 2019 International Conference on Bioinformatics and Computational Biology (BICOB-2019). J. Bioinform. Comput. Biol. 17 (6) (2019)
Alexey Markin, Oliver Eulenstein
Computing Manhattan Path-Difference Median Trees: A Practical Local Search Approach. IEEE ACM Trans. Comput. Biol. Bioinform. 16 (4) (2019)
Alexey Markin, Venkata Sai Krishna Teja Vadali, Oliver Eulenstein
Solving the Gene Duplication Feasibility Problem in Linear Time. COCOON (2018)
Jucheol Moon, Oliver Eulenstein
Cluster Matching Distance for Rooted Phylogenetic Trees. ISBRA (2018)
Pawel Tabaszewski, Pawel Górecki, Oliver Eulenstein
Phylogenetic Consensus for Exact Median Trees. BCB (2018)
Pawel Górecki, Alexey Markin, Oliver Eulenstein
Cophenetic Distances: A Near-Linear Time Algorithmic Framework. COCOON (2018)
Hisham Al-Mubaid, Qin Ding, Oliver Eulenstein
Introduction to JBCB Special Issue on BICOB-2018. J. Bioinform. Comput. Biol. 16 (5) (2018)
Pawel Górecki, Oliver Eulenstein
Bijective Diameters of Gene Tree Parsimony Costs. IEEE ACM Trans. Comput. Biol. Bioinform. 15 (5) (2018)
Pawel Górecki, Jaroslaw Paszek, Oliver Eulenstein
Unconstrained Diameters for Deep Coalescence. IEEE ACM Trans. Comput. Biol. Bioinform. 14 (5) (2017)
Jucheol Moon, Oliver Eulenstein
Synthesizing Species Trees from Unrooted Gene Trees: A Parameterized Approach. BCB (2017)
Pawel Górecki, Alexey Markin, Agnieszka Mykowiecka, Jaroslaw Paszek, Oliver Eulenstein
Phylogenetic Tree Reconciliation: Mean Values for Fixed Gene Trees. ISBRA (2017)
Jucheol Moon, Oliver Eulenstein
Synthesizing large-scale species trees using the strict consensus approach. J. Bioinform. Comput. Biol. 15 (3) (2017)
Oliver Eulenstein, Qin Ding, Hisham Al-Mubaid
Foreword. J. Bioinform. Comput. Biol. 15 (6) (2017)
Alexey Markin, Oliver Eulenstein
Cophenetic Median Trees Under the Manhattan Distance. BCB (2017)
Jucheol Moon, Oliver Eulenstein
Robinson-Foulds Median Trees: A Clique-based Heuristic. BCB (2016)
Alexey Markin, Oliver Eulenstein
Manhattan Path-Difference Median Trees. BCB (2016)
Jucheol Moon, Iddo Friedberg, Oliver Eulenstein
Highly Bi-Connected Subgraphs for Computational Protein Function Annotation. COCOON (2016)
Alexey Markin, Oliver Eulenstein
Path-Difference Median Trees. ISBRA (2016)
Jucheol Moon, Harris T. Lin, Oliver Eulenstein
Consensus properties and their large-scale applications for the gene duplication problem. J. Bioinform. Comput. Biol. 14 (3) (2016)
Pawel Górecki, Oliver Eulenstein
Gene Tree Diameter for Deep Coalescence. IEEE ACM Trans. Comput. Biol. Bioinform. 12 (1) (2015)
Pawel Górecki, Oliver Eulenstein
Refining discordant gene trees. BMC Bioinform. 15 (S-13) (2014)
Cynthia Gibas, Zhipeng Cai, Oliver Eulenstein
International Symposium on Biomedical Research and Applications. BMC Bioinform. 15 (S-13) (2014)
Sabine Baumann, Oliver Eulenstein
Big Guys and Big Data: Mining Shareholder Interaction Networks of Transnational MediaCompanies with Weighted Quasi-Bicliques. MKWI (2014)
Pawel Górecki, Jaroslaw Paszek, Oliver Eulenstein
Duplication Cost Diameters. ISBRA (2014)
Zhipeng Cai, Oliver Eulenstein, Cynthia Gibas
Guest Editors Introduction to the Special Section on Bioinformatics Research and Applications. IEEE ACM Trans. Comput. Biol. Bioinform. 11 (3) (2014)
Pawel Górecki, Oliver Eulenstein
Maximizing Deep Coalescence Cost. IEEE ACM Trans. Comput. Biol. Bioinform. 11 (1) (2014)
Pawel Górecki, Oliver Eulenstein
DrML: Probabilistic Modeling of Gene Duplications. J. Comput. Biol. 21 (1) (2014)
Pawel Górecki, Jaroslaw Paszek, Oliver Eulenstein
Unconstrained gene tree diameters for deep coalescence. BCB (2014)
André Wehe, J. Gordon Burleigh, Oliver Eulenstein
Efficient Algorithms for Knowledge-Enhanced Supertree and Supermatrix Phylogenetic Problems. IEEE ACM Trans. Comput. Biol. Bioinform. 10 (6) (2013)
Mukul S. Bansal, Oliver Eulenstein
Algorithms for Genome-Scale Phylogenetics Using Gene Tree Parsimony. IEEE ACM Trans. Comput. Biol. Bioinform. 10 (4) (2013)
Pawel Górecki, Oliver Eulenstein, Jerzy Tiuryn
Unrooted Tree Reconciliation: A Unified Approach. IEEE ACM Trans. Comput. Biol. Bioinform. 10 (2) (2013)
Wen-Chieh Chang, Pawel Górecki, Oliver Eulenstein
Exact solutions for species Tree Inference from discordant gene Trees. J. Bioinform. Comput. Biol. 11 (5) (2013)
Pawel Górecki, Oliver Eulenstein
Algorithms: simultaneous error-correction and rooting for gene tree reconciliation and the gene duplication problem. BMC Bioinform. 13 (S-10) (2012)
Ruchi Chaudhary, J. Gordon Burleigh, Oliver Eulenstein
Efficient error correction algorithms for gene tree reconciliation based on duplication, duplication and loss, and deep coalescence. BMC Bioinform. 13 (S-10) (2012)
Harris T. Lin, J. Gordon Burleigh, Oliver Eulenstein
Consensus properties for the deep coalescence problem and their application for scalable tree search. BMC Bioinform. 13 (S-10) (2012)
Pawel Górecki, Oliver Eulenstein
A Robinson-Foulds Measure to Compare Unrooted Trees with Rooted Trees. ISBRA (2012)
Pawel Górecki, Oliver Eulenstein
Deep Coalescence Reconciliation with Unrooted Gene Trees: Linear Time Algorithms. COCOON (2012)
André Wehe, J. Gordon Burleigh, Oliver Eulenstein
Algorithms for Knowledge-Enhanced Supertrees. ISBRA (2012)
Wen-Chieh Chang, Sudheer Vakati, Roland Krause, Oliver Eulenstein
Exploring biological interaction networks with tailored weighted quasi-bicliques. BMC Bioinform. 13 (S-10) (2012)
Pawel Górecki, J. Gordon Burleigh, Oliver Eulenstein
GTP Supertrees from Unrooted Gene Trees: Linear Time Algorithms for NNI Based Local Searches. ISBRA (2012)
Ruchi Chaudhary, J. Gordon Burleigh, Oliver Eulenstein
Algorithms for Rapid Error Correction for the Gene Duplication Problem. ISBRA (2011)
Wen-Chieh Chang, Sudheer Vakati, Roland Krause, Oliver Eulenstein
Mining Biological Interaction Networks Using Weighted Quasi-Bicliques. ISBRA (2011)
Wen-Chieh Chang, J. Gordon Burleigh, David Fernández-Baca, Oliver Eulenstein
An ILP solution for the gene duplication problem. BMC Bioinform. 12 (S-1) (2011)
Pawel Górecki, Oliver Eulenstein
A Linear Time Algorithm for Error-Corrected Reconciliation of Unrooted Gene Trees. ISBRA (2011)
Oliver Eulenstein
Invited: Reconciled gene trees and their applications. ICCABS (2011)
John Wiedenhoeft, Roland Krause, Oliver Eulenstein
The Plexus Model for the Inference of Ancestral Multidomain Proteins. IEEE ACM Trans. Comput. Biol. Bioinform. 8 (4) (2011)
Harris T. Lin, J. Gordon Burleigh, Oliver Eulenstein
The Deep Coalescence Consensus Tree Problem is Pareto on Clusters. ISBRA (2011)
Pawel Górecki, J. Gordon Burleigh, Oliver Eulenstein
Maximum likelihood models and algorithms for gene tree evolution with duplications and losses. BMC Bioinform. 12 (S-1) (2011)
Mukul S. Bansal, J. Gordon Burleigh, Oliver Eulenstein
Efficient genome-scale phylogenetic analysis under the duplication-loss and deep coalescence cost models. BMC Bioinform. 11 (S-1) (2010)
J. Gordon Burleigh, Mukul S. Bansal, Oliver Eulenstein, Todd J. Vision
Inferring species trees from gene duplication episodes. BCB (2010)
John Wiedenhoeft, Roland Krause, Oliver Eulenstein
Inferring Evolutionary Scenarios for Protein Domain Compositions. ISBRA (2010)
Mukul S. Bansal, J. Gordon Burleigh, Oliver Eulenstein, David Fernández-Baca
Robinson-Foulds Supertrees. Algorithms Mol. Biol. 5 (2010)
André Wehe, Wen-Chieh Chang, Oliver Eulenstein, Srinivas Aluru
A scalable parallelization of the gene duplication problem. J. Parallel Distributed Comput. 70 (3) (2010)
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 Bioinform. 11 (2010)
Max Homilius, John Gordon Burleigh, Oliver Eulenstein
Triplet-Supertrees constructed from Minimum Triplet Presentations. BICoB (2010)
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. J. Comput. Biol. 16 (8) (2009)
Mukul S. Bansal, Oliver Eulenstein, André Wehe
The Gene-Duplication Problem: Near-Linear Time Algorithms for NNI-Based Local Searches. IEEE ACM Trans. Comput. Biol. Bioinform. 6 (2) (2009)
Mukul S. Bansal, Wen-Chieh Chang, Oliver Eulenstein, David Fernández-Baca
Generalized Binary Tanglegrams: Algorithms and Applications. BICoB (2009)
Harris T. Lin, J. Gordon Burleigh, Oliver Eulenstein
Triplet supertree heuristics for the tree of life. BMC Bioinform. 10 (S-1) (2009)
Mukul S. Bansal, Oliver Eulenstein
The Gene-Duplication Problem: Near-Linear Time Algorithms for NNI Based Local Searches. ISBRA (2008)
Mukul S. Bansal, Oliver Eulenstein
The multiple gene duplication problem revisited. ISMB (2008)
J. Gordon Burleigh, Mukul S. Bansal, André Wehe, Oliver Eulenstein
Locating Multiple Gene Duplications through Reconciled Trees. RECOMB (2008)
André Wehe, Mukul S. Bansal, J. Gordon Burleigh, Oliver Eulenstein
DupTree: a program for large-scale phylogenetic analyses using gene tree parsimony. Bioinform. 24 (13) (2008)
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. Biol. Bioinform. 5 (4) (2008)
Mukul S. Bansal, J. Gordon Burleigh, Oliver Eulenstein, André Wehe
) Speed-Up for the Local Search. RECOMB (2007)
Mukul S. Bansal, Oliver Eulenstein
) Speed-Up of TBR Heuristics for the Gene-Duplication Problem. WABI (2007)
Wen-Chieh Chang, Oliver Eulenstein
Reconciling Gene Trees with Apparent Polytomies. COCOON (2006)
Duhong Chen, Oliver Eulenstein, David Fernández-Baca, Michael J. Sanderson
Minimum-Flip Supertrees: Complexity and Algorithms. IEEE ACM Trans. Comput. Biol. Bioinform. 3 (2) (2006)
Duhong Chen, Oliver Eulenstein, David Fernández-Baca
Rainbow: a toolbox for phylogenetic supertree construction and analysis. Bioinform. 20 (16) (2004)
Duhong Chen, Oliver Eulenstein, David Fernández-Baca, Michael J. Sanderson
Supertrees by Flipping. COCOON (2002)
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)
Duhong Chen, Lixia Diao, Oliver Eulenstein, David Fernández-Baca, Michael J. Sanderson
Flipping: A supertree construction method. Bioconsensus (2001)
Oliver Eulenstein, Martin Vingron
On the Equivalence of Two Tree Mapping Measures. Discret. Appl. Math. 88 (1-3) (1998)
Yan P. Yuan, Oliver Eulenstein, Martin Vingron, Peer Bork
Towards detection of orthologues in sequence databases. Bioinform. 14 (3) (1998)
Oliver Eulenstein, Boris G. Mirkin, Martin Vingron
Duplication-Based Measures of Difference Between Gene and Species Trees. J. Comput. Biol. 5 (1) (1998)
Yan P. Yuan, Oliver Eulenstein, Martin Vingron, Peer Bork
Towards detection of sequence orthologs. German Conference on Bioinformatics (1997)
Oliver Eulenstein, Boris G. Mirkin, Martin Vingron
Comparison of annotating duplication, tree mapping, and copying as methods to compare gene trees with species trees. Mathematical Hierarchies and Biology (1996)

Oliver Eulenstein.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Oliver Eulenstein