Name
Affiliation
Papers
OLIVER EULENSTEIN
Department of Computer Science, Iowa State University, Ames, IA 50011, USA
73
Collaborators
Citations 
PageRank 
52
505
52.71
Referers 
Referees 
References 
618
456
664
Search Limit
100618
Title
Citations
PageRank
Year
The Unconstrained Diameters of the Duplication-Loss Cost and the Loss Cost00.342021
Consensus of All Solutions for Intractable Phylogenetic Tree Inference00.342021
The Cluster Affinity Distance for Phylogenies.00.342019
Foreword: Special Issue for the 2019 International Conference on Bioinformatics and Computational Biology (BICOB-2019)00.342019
Robinson-Foulds Reticulation Networks.00.342019
Consensus Clusters in Robinson-Foulds Reticulation Networks.00.342019
Mathematical properties of the gene duplication cost.00.342019
Feasibility Algorithms for the Duplication-Loss Cost.00.342019
Introduction to JBCB Special Issue on BICOB-2018.00.342018
Cluster Matching Distance for Rooted Phylogenetic Trees.00.342018
Bijective Diameters of Gene Tree Parsimony Costs.20.402018
Phylogenetic Consensus for Exact Median Trees.00.342018
Cophenetic Median Trees Under the Manhattan Distance00.342017
Synthesizing large-scale species trees using the strict consensus approach.10.362017
Unconstrained Diameters for Deep Coalescence.10.372017
Synthesizing Species Trees from Unrooted Gene Trees: A Parameterized Approach10.372017
Path-Difference Median Trees.00.342016
Manhattan Path-Difference Median Trees.00.342016
Robinson-Foulds Median Trees: A Clique-based Heuristic.00.342016
Consensus properties and their large-scale applications for the gene duplication problem.30.452016
DrML: probabilistic modeling of gene duplications.10.362014
Unconstrained gene tree diameters for deep coalescence20.392014
Duplication Cost Diameters.10.362014
Maximizing Deep Coalescence Cost.40.422014
Refining discordant gene trees.20.382014
Guest Editors Introduction to the Special Section on Bioinformatics Research and Applications10.432014
Unrooted Tree Reconciliation: A Unified Approach170.752013
Algorithms for Genome-Scale Phylogenetics Using Gene Tree Parsimony.60.512013
Exact solutions for species tree inference from discordant gene trees.120.662013
Efficient algorithms for knowledge-enhanced supertree and supermatrix phylogenetic problems.60.512013
GTP supertrees from unrooted gene trees: linear time algorithms for NNI based local searches80.532012
Algorithms: simultaneous error-correction and rooting for gene tree reconciliation and the gene duplication problem.180.672012
Exploring biological interaction networks with tailored weighted quasi-bicliques.130.522012
Deep Coalescence Reconciliation with Unrooted Gene Trees: Linear Time Algorithms.90.622012
Efficient error correction algorithms for gene tree reconciliation based on duplication, duplication and loss, and deep coalescence.130.592012
A robinson-foulds measure to compare unrooted trees with rooted trees50.482012
Algorithms for knowledge-enhanced supertrees10.352012
Consensus properties for the deep coalescence problem and their application for scalable tree search.150.612012
Mining biological interaction networks using weighted quasi-bicliques20.462011
Maximum likelihood models and algorithms for gene tree evolution with duplications and losses.180.702011
An ILP solution for the gene duplication problem.190.682011
Algorithms for rapid error correction for the gene duplication problem30.402011
A linear time algorithm for error-corrected reconciliation of unrooted gene trees150.702011
The deep coalescence consensus tree problem is Pareto on clusters40.512011
The plexus model for the inference of ancestral multidomain proteins.10.372011
Invited: Reconciled gene trees and their applications00.342011
Efficient genome-scale phylogenetic analysis under the duplication-loss and deep coalescence cost models.281.202010
Triplet-Supertrees constructed from Minimum Triplet Presentations00.342010
iGTP: a software package for large-scale gene tree parsimony analysis.301.072010
Inferring species trees from gene duplication episodes30.422010
  • 1
  • 2