Computational Biology Research Team

Publications

---Preprints---

PREMISE: A Quality-Aware Probabilistic Framework for Pathogen Resolution and Source Assignment in Viral mNGS

Vijendran, Sriram; Dorman, Karin; Anderson, Tavis K; Eulenstein, Oliver

bioRxiv, 2026

---2026---

The topology diameters of the asymmetric cluster affinity cost

Górecki, Pawel; Wagle, Sanket; Eulenstein, Oliver

Discrete Applied Mathematics, 378(1), 602–612, 2026 Paper

---2025---

Phylo-rs: an extensible phylogenetic analysis library in rust

Vijendran, Sriram; Markin, Alexey; Anderson, Tavis K; Eulenstein, Oliver

BMC bioinformatics, 26(1), 197, 2025 Paper

Computing generalized cophenetic distances under all L p norms: A near-linear time algorithmic framework

Górecki, Pawel; Markin, Alexey; Vijendran, Sriram; Eulenstein, Oliver

PLOS Computational Biology, 21(6), e1013069, 2025 Paper

---2023---

Phylogenetic diversity statistics for all clades in a phylogeny

Grover, Siddhant; Markin, Alexey; Anderson, Tavis K; Eulenstein, Oliver

Bioinformatics, 39(Supplement 1), i177–i184, 2023 Paper

The Asymmetric Cluster Affinity Cost

Wagle, Sanket; Markin, Alexey; Górecki, Pawel; Anderson, Tavis K; Eulenstein, Oliver

Comparative Genomics, 131–145, 2023 Paper

---2022---

RF-Net 2: fast inference of virus reassortment and hybridization networks

Markin, Alexey; Wagle, Sanket; Anderson, Tavis K; Eulenstein, Oliver

Bioinformatics, 38(8), 2144–2152, 2022 Paper

Scalable and Extensible Robinson-Foulds for Comparative Phylogenetics

Chon, Alvin; Huang, Xiaoqiu; Eulenstein, Oliver; Jannesari, Ali

21st IEEE International Workshop on High Performance Computational Biology, 2022 Paper

CPTAM: Constituency Parse Tree Aggregation Method

Kulkarni, Adithya; Sabetpour, Nasim; Markin, Alexey; Eulenstein, Oliver; Li, Qi

SIAM International Conference on Data Mining (SDM 2022), 2022 Paper

---2021---

Taming the Duplication-Loss-Coalescence Model with Integer Linear Programming

Paszek, Jarosław; Markin, Alexey; Górecki, Paweł; Eulenstein, Oliver

Journal of Computational Biology, 28(8), 758–773, 2021 Paper

Novel genomic duplication models through integer linear programming

Paszek, Jarosław; Eulenstein, Oliver; Górecki, Paweł

Proceedings of the 12th ACM Conference on Bioinformatics, Computational Biology, and Health Informatics, 1–11, 2021 Paper

---2020---

Quartet-based inference methods are statistically consistent under the unified duplication-loss-coalescence model

Markin, Alexey; Eulenstein, Oliver

Bioinformatics, 37(22), 4064–4074, 2020 Paper

Finding orthologous gene blocks in bacteria: the computational hardness of the problem and novel methods to address it

Nguyen, Huy N; Markin, Alexey; Friedberg, Iddo; Eulenstein, Oliver

Bioinformatics, 36(Supplement_2), i668–i674, 2020 Paper

Exact median-tree inference for unrooted reconciliation costs

Górecki, Paweł; Markin, Alexey; Eulenstein, Oliver

BMC Evolutionary Biology, 20(1), 1–15, 2020 Paper

Integer Linear Programming Formulation for the Unified Duplication-Loss-Coalescence Model

Ansarifar, Javad; Markin, Alexey; Górecki, Paweł; Eulenstein, Oliver

International Symposium on Bioinformatics Research and Applications, 229–242, 2020 Paper

---2019---

The Unconstrained Diameters of the Duplication-Loss Cost and the Loss Cost

Górecki, Paweł; Eulenstein, Oliver; Tiuryn, Jerzy

IEEE/ACM Transactions on Computational Biology and Bioinformatics, 18(6), 2125–2135, 2019 Paper

Consensus of all Solutions for Intractable Phylogenetic Tree Inference

Tabaszewski, Pawel; Górecki, Pawel; Markin, Alexey; Anderson, T; Eulenstein, Oliver

IEEE/ACM transactions on computational biology and bioinformatics, 18(1), 149–161, 2019 Paper

Tracing the ancestry of operons in bacteria

Nguyen, Huy N; Jain, Ashish; Eulenstein, Oliver; Friedberg, Iddo

Bioinformatics, 35(17), 2998–3004, 2019 Paper

Robinson-foulds reticulation networks

Markin, Alexey; Anderson, Tavis K; Vadali, Venkata Sai Krishna Teja; Eulenstein, Oliver

Proceedings of the 10th ACM International Conference on Bioinformatics, Computational Biology and Health Informatics, 77–86, 2019 Paper

Consensus clusters in robinson-foulds reticulation networks

Markin, Alexey; Eulenstein, Oliver

19th International Workshop on Algorithms in Bioinformatics (WABI 2019), 2019 Paper

Feasibility Algorithms for the Duplication-Loss Cost

Górecki, Paweł; Markin, Alexey; Eulenstein, Oliver

International Computing and Combinatorics Conference, 206–218, 2019 Paper

The Cluster Affinity Distance for Phylogenies

Moon, Jucheol; Eulenstein, Oliver

International Symposium on Bioinformatics Research and Applications, 52–64, 2019 Paper

---2018---

Cophenetic median trees

Markin, Alexey; Eulenstein, Oliver

IEEE/ACM transactions on computational biology and bioinformatics, 16(5), 1459–1470, 2018 Paper

Phylogenetic consensus for exact median trees

Tabaszewski, Pawel; Górecki, Pawel; Eulenstein, Oliver

Proceedings of the 2018 ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics, 366–375, 2018 Paper

Cophenetic distances: A near-linear time algorithmic framework

Górecki, Paweł; Markin, Alexey; Eulenstein, Oliver

International Computing and Combinatorics Conference, 168–179, 2018 Paper

Solving the gene duplication feasibility problem in linear time

Markin, Alexey; Vadali, Venkata Sai Krishna Teja; Eulenstein, Oliver

International Computing and Combinatorics Conference, 378–390, 2018 Paper

Cluster matching distance for rooted phylogenetic trees

Moon, Jucheol; Eulenstein, Oliver

International Symposium on Bioinformatics Research and Applications, 321–332, 2018 Paper

---2017---

Bijective diameters of gene tree parsimony costs

Górecki, Paweł; Eulenstein, Oliver

IEEE/ACM Transactions on Computational Biology and Bioinformatics, 15(5), 1723–1727, 2017 Paper

Efficient local search for Euclidean path-difference median trees

Markin, Alexey; Eulenstein, Oliver

IEEE/ACM Transactions on Computational Biology and Bioinformatics, 16(4), 1374–1385, 2017 Paper

Computing Manhattan path-difference median trees: A practical local search approach

Markin, Alexey; Eulenstein, Oliver

IEEE/ACM Transactions on Computational Biology and Bioinformatics, 16(4), 1063–1076, 2017 Paper

Synthesizing large-scale species trees using the strict consensus approach

Moon, Jucheol; Eulenstein, Oliver

Journal of bioinformatics and computational biology, 15(03), 1740002, 2017 Paper

Cophenetic median trees under the manhattan distance

Markin, Alexey; Eulenstein, Oliver

Proceedings of the 8th ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics, 194–202, 2017 Paper

Phylogenetic Tree Reconciliation: Mean Values for Fixed Gene Trees

Górecki, Paweł; Markin, Alexey; Mykowiecka, Agnieszka; Paszek, Jarosław; Eulenstein, Oliver

International Symposium on Bioinformatics Research and Applications, 234–245, 2017 Paper

---2016---

Unconstrained diameters for deep coalescence

Górecki, Paweł; Paszek, Jarosław; Eulenstein, Oliver

IEEE/ACM Transactions on Computational Biology and Bioinformatics, 14(5), 1002–1012, 2016 Paper

Consensus properties and their large-scale applications for the gene duplication problem

Moon, Jucheol; Lin, Harris T; Eulenstein, Oliver

Journal of bioinformatics and computational biology, 14(03), 1642005, 2016 Paper

Manhattan path-difference median trees

Markin, Alexey; Eulenstein, Oliver

Proceedings of the 7th ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics, 404–413, 2016 Paper

Robinson-Foulds Median Trees: A Clique-based Heuristic

Moon, Jucheol; Eulenstein, Oliver

Proceedings of the 7th ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics, 374–383, 2016 Paper

Highly bi-connected subgraphs for computational protein function annotation

Moon, Jucheol; Friedberg, Iddo; Eulenstein, Oliver

International Computing and Combinatorics Conference, 573–584, 2016 Paper

Path-difference median trees

Markin, Alexey; Eulenstein, Oliver

International Symposium on Bioinformatics Research and Applications, 211–223, 2016 Paper

---2015---

Consensus properties of the gene duplication problem for enhanced phylogenetic inference

Lin, H; Moon, Jucheol; Eulenstein, Oliver

Proceedings of the International Conference on Bioinformatics and Computational Biology. Curran Associates, Inc., Red Hook, New York, United States, 131–136, 2015 Paper

---2014---

Duplication cost diameters

Górecki, Paweł; Paszek, Jarosław; Eulenstein, Oliver

International Symposium on Bioinformatics Research and Applications, 212–223, 2014 Paper

Gene tree diameter for deep coalescence

Górecki, Paweł; Eulenstein, Oliver

IEEE/ACM Transactions on Computational Biology and Bioinformatics, 12(1), 155–165, 2014 Paper

Refining discordant gene trees

Górecki, Pawel; Eulenstein, Oliver

BMC bioinformatics, 1–10, 2014 Paper

DrML: probabilistic modeling of gene duplications

Górecki, Paweł; Eulenstein, Oliver

Journal of Computational Biology, 21(1), 89–98, 2014 Paper

Unconstrained gene tree diameters for deep coalescence

Górecki, Paweł; Paszek, Jarosław; Eulenstein, Oliver

Proceedings of the 5th ACM Conference on Bioinformatics, Computational Biology, and Health Informatics, 114–121, 2014 Paper

---2013---

Maximizing deep coalescence cost

Gorecki, Pawel; Eulenstein, Oliver

IEEE/ACM transactions on computational biology and bioinformatics, 11(1), 231–242, 2013 Paper

Unrooted tree reconciliation: A unified approach

Górecki, Pawel; Eulenstein, Oliver; Tiuryn, Jerzy

IEEE/ACM transactions on computational biology and bioinformatics, 10(2), 522–536, 2013 Paper

Exact solutions for classic gene tree parsimony problems

Chang, Wen-Chieh; Wehe, André; Górecki, Paweł; Eulenstein, Oliver

Proc. of the 5th Int. Conf. on Bioinformatics and Computational Biology, 225–230, 2013 Paper

Bioinformatics Research and Applications: 9th International Symposium, ISBRA 2013, Charlotte, NC, USA, May 20-22, 2013, Proceedings

Cai, Zhipeng; Eulenstein, Oliver; Janies, Daniel; Schwartz, Daniel

Springer, 7875, 2013 Paper

Algorithms for Unrooted Gene Trees with Polytomies

Górecki, Paweł; Eulenstein, Oliver

Short Abstract Proceedings of ISBRA:86-95, 2013 Paper

Mathematical Properties and Normalization of the Gene Duplication Cost

Shrader, Bryan; Wehe, André; Eulenstein, Oliver

Short Abstract Proceedings of ISBRA:92-96, 2013

---2012---

Efficient algorithms for knowledge-enhanced supertree and supermatrix phylogenetic problems

Wehe, André; Burleigh, J Gordon; Eulenstein, Oliver

IEEE/ACM transactions on computational biology and bioinformatics, 10(6), 1432–1441, 2012 Paper

Algorithms: simultaneous error-correction and rooting for gene tree reconciliation and the gene duplication problem

Górecki, Pawel; Eulenstein, Oliver

BMC bioinformatics, 1–11, 2012 Paper

Exploring biological interaction networks with tailored weighted quasi-bicliques

Chang, Wen-Chieh; Vakati, Sudheer; Krause, Roland; Eulenstein, Oliver

BMC bioinformatics, 1–9, 2012 Paper

Efficient algorithms for rapid error correction for gene tree reconciliation using gene duplications, gene duplication and loss, and deep coalescence

Chaudhari, R; Burleigh, GJ; Eulenstein, O

BMC Bioinformatics, 13(Suppl 10), S11, 2012 Paper

Consensus properties for the deep coalescence problem and their application for scalable tree search

Lin, Harris T; Burleigh, J Gordon; Eulenstein, Oliver

BMC bioinformatics, 1–13, 2012 Paper

Who Pulls the Strings Behind the Scenes? Analysing Power Structures of International Media Finance Networks with Innovative Graph-Based Methods

Baumann, Sabine; Eulenstein, Oliver

Internet, Politics, Policy: Big Data, Big Challenges 2012 pg 21–22, 2012 Paper

Algorithms for knowledge-enhanced supertrees

Wehe, André; Burleigh, J Gordon; Eulenstein, Oliver

International Symposium on Bioinformatics Research and Applications, 263–274, 2012 Paper

GTP supertrees from unrooted gene trees: linear time algorithms for NNI based local searches

Górecki, Paweł; Burleigh, J Gordon; Eulenstein, Oliver

International Symposium on Bioinformatics Research and Applications, 102–114, 2012 Paper

Deep coalescence reconciliation with unrooted gene trees: Linear time algorithms

Górecki, Paweł; Eulenstein, Oliver

International Computing and Combinatorics Conference, 531–542, 2012 Paper

A Robinson-Foulds measure to compare unrooted trees with rooted trees

Górecki, Paweł; Eulenstein, Oliver

International Symposium on Bioinformatics Research and Applications, 115–126, 2012 Paper

---2011---

Maximum likelihood models and algorithms for gene tree evolution with duplications and losses

Górecki, Pawel; Burleigh, Gordon J; Eulenstein, Oliver

BMC bioinformatics, 12(1), 1–9, 2011 Paper

An ILP solution for the gene duplication problem

Chang, Wen-Chieh; Burleigh, Gordon J; Fernández-Baca, David F; Eulenstein, Oliver

BMC bioinformatics, 12(1), 1–8, 2011 Paper

Genome-scale phylogenetics: inferring the plant tree of life from 18,896 gene trees

Burleigh, J Gordon; Bansal, Mukul S; Eulenstein, Oliver; Hartmann, Stefanie; Wehe, André; Vision, Todd J

Systematic Biology, 60(2), 117–125, 2011 Paper

The plexus model for the inference of ancestral multidomain proteins

Wiedenhoeft, John; Krause, Roland; Eulenstein, Oliver

IEEE/ACM Transactions on Computational Biology and Bioinformatics, 8(4), 890–901, 2011 Paper

A linear time algorithm for error-corrected reconciliation of unrooted gene trees

Górecki, Paweł; Eulenstein, Oliver

International Symposium on Bioinformatics Research and Applications, 148–159, 2011 Paper

Mining biological interaction networks using weighted quasi-bicliques

Chang, Wen-Chieh; Vakati, Sudheer; Krause, Roland; Eulenstein, Oliver

International Symposium on Bioinformatics Research and Applications, 428–439, 2011 Paper

Algorithms for rapid error correction for the gene duplication problem

Chaudhary, Ruchi; Burleigh, J Gordon; Eulenstein, Oliver

International Symposium on Bioinformatics Research and Applications, 227–239, 2011 Paper

Life in the Fast Lane: Analysing corporate communication networks with innovative graph-based methods to prepare for crisis situations

Baumann, Sabine; Eulenstein, Oliver

Centre for Corporate Communication (Hrsg.) Communicating Crisis in an Age of Complexity, Conference Proceedings #1 of the 2nd International Conference on Crisis Communication at the Beginning of the 21st Century, 20–44, 2011 Paper

Reconciled gene trees and their applications

Eulenstein, Oliver

2011 IEEE 1st International Conference on Computational Advances in Bio and Medical Sciences (ICCABS), 6–6, 2011 Paper

The deep coalescence consensus tree problem is pareto on clusters

Lin, Harris T; Burleigh, J Gordon; Eulenstein, Oliver

International Symposium on Bioinformatics Research and Applications, 172–183, 2011 Paper

---2010---

iGTP: a software package for large-scale gene tree parsimony analysis

Chaudhary, Ruchi; Bansal, Mukul S; Wehe, André; Fernández-Baca, David; Eulenstein, Oliver

BMC bioinformatics, 11(1), 1–7, 2010 Paper

Robinson-foulds supertrees

Bansal, Mukul S; Burleigh, J Gordon; Eulenstein, Oliver; Fernández-Baca, David

Algorithms for molecular biology, 5(1), 1–12, 2010 Paper

A scalable parallelization of the gene duplication problem

Wehe, André; Chang, Wen-Chieh; Eulenstein, Oliver; Aluru, Srinivas

Journal of Parallel and Distributed Computing, 70(3), 237–244, 2010 Paper

Efficient genome-scale phylogenetic analysis under the duplication-loss and deep coalescence cost models

Bansal, Mukul S; Burleigh, J Gordon; Eulenstein, Oliver

BMC bioinformatics, 11(1), 1–9, 2010 Paper

Inferring species trees from gene duplication episodes

Burleigh, J Gordon; Bansal, Mukul S; Eulenstein, Oliver; Vision, Todd J

Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology, 198–203, 2010 Paper

Triplet-Supertrees constructed from Minimum Triplet Presentations.

Homilius, Max; Burleigh, John Gordon; Eulenstein, Oliver

BICoB, 127–132, 2010 Paper

Inferring evolutionary scenarios for protein domain compositions

Wiedenhoeft, John; Krause, Roland; Eulenstein, Oliver

International Symposium on Bioinformatics Research and Applications, 179–190, 2010 Paper

Reconciling phylogenetic trees

Eulenstein, Oliver; Huzurbazar, S.; Liberles, David

Wiley, New York, 185–206, 2010 Paper

---2009---

The gene-duplication problem: Near-linear time algorithms for NNI-based local searches

Bansal, Mukul S; Eulenstein, Oliver; Wehe, André

IEEE/ACM Transactions on Computational Biology and Bioinformatics, 6(2), 221–231, 2009 Paper

Triplet supertree heuristics for the tree of life

Lin, Harris T; Burleigh, J Gordon; Eulenstein, Oliver

BMC bioinformatics, 10(1), 1–12, 2009 Paper

Locating large-scale gene duplication events through reconciled trees: implications for identifying ancient polyploidy events in plants

Burleigh, John Gordon; Bansal, Mukul S; Wehe, André; Eulenstein, Oliver

Journal of Computational Biology, 16(8), 1071–1083, 2009 Paper

Groves of phylogenetic trees

Ané, Cécile; Eulenstein, Oliver; Piaggio-Talice, Raul; Sanderson, Michael J

Annals of Combinatorics, 13(2), 139–167, 2009 Paper

Generalized binary tanglegrams: Algorithms and applications

Bansal, Mukul S; Chang, Wen-Chieh; Eulenstein, Oliver; Fernández-Baca, David

International Conference on Bioinformatics and Computational Biology, 114–125, 2009 Paper

---2008---

DupTree: a program for large-scale phylogenetic analyses using gene tree parsimony

Wehe, André; Bansal, Mukul S; Burleigh, J Gordon; Eulenstein, Oliver

Bioinformatics, 24(13), 1540–1541, 2008 Paper

The multiple gene duplication problem revisited

Bansal, Mukul S; Eulenstein, Oliver

Bioinformatics, 24(13), i132–i138, 2008 Paper

An Ømega (n^ 2/log n) Speed-Up of TBR Heuristics for the Gene-Duplication Problem

Bansal, Mukul S; Eulenstein, Oliver

IEEE/ACM Transactions on Computational Biology and Bioinformatics, 5(4), 514–524, 2008 Paper

Locating multiple gene duplications through reconciled trees

Burleigh, J Gordon; Bansal, Mukul S; Wehe, Andre; Eulenstein, Oliver

Annual International Conference on Research in Computational Molecular Biology, 273–284, 2008 Paper

The gene-duplication problem: near-linear time algorithms for NNI based local searches

Bansal, Mukul S; Eulenstein, Oliver

International Symposium on Bioinformatics Research and Applications, 14–25, 2008 Paper

---2007---

An Ømega (n 2/logn) Speed-Up of Heuristics for the Gene-Duplication Problem

Bansal, Mukul S; Eulenstein, Oliver

International Workshop on Algorithms in Bioinformatics, 124–135, 2007 Paper

Heuristics for the gene-duplication problem: A Θ (n) speed-up for the local search

Bansal, Mukul S; Burleigh, J Gordon; Eulenstein, Oliver; Wehe, André

Annual International Conference on Research in Computational Molecular Biology, 238–252, 2007 Paper

Fragmentation of large data sets in phylogenetic analyses

Sanderson, Michael J.; Ané, Cécile; Eulenstein, Oliver; Fernández-Baca, David; Kim, Junhyong; McMahon, Michelle M.; Piaggio-Talice, Raul

Oxford University Press, 199–216, 2007 Paper

---2006---

Improved heuristics for minimum-flip supertree construction

Chen, Duhong; Eulenstein, Oliver; Fernández-Baca, David; Burleigh, J Gordon

Evolutionary Bioinformatics, 2, 117693430600200003, 2006 Paper

Minimum-flip supertrees: complexity and algorithms

Chen, Duhong; Eulenstein, Oliver; Fernandez-Baca, David; Sanderson, Michael

IEEE/ACM transactions on computational biology and bioinformatics, 3(2), 165–173, 2006 Paper

Reconciling gene trees with apparent polytomies

Chang, Wen-Chieh; Eulenstein, Oliver

International Computing and Combinatorics Conference, 235–244, 2006 Paper

---2005---

Identifying optimal incomplete phylogenetic data sets from sequence databases

Yan, Changhui; Burleigh, J Gordon; Eulenstein, Oliver

Molecular phylogenetics and evolution, 35(3), 528–535, 2005 Paper

The shape of supertrees to come: tree shape related properties of fourteen supertree methods

Wilkinson, Mark; Cotton, James A; Creevey, Chris; Eulenstein, Oliver; Harris, Simon R; Lapointe, Francois-Joseph; Levasseur, Claudine; Mcinerney, James O; Pisani, Davide; Thorley, Joseph L

Systematic biology, 54(3), 419–431, 2005 Paper

Consensus trees and supertrees

Eulenstein, Oliver

Hall/CRC, 2005 Paper

---2004---

Performance of flip supertree construction with a heuristic algorithm

Eulenstein, Oliver; Chen, Duhong; Burleigh, J Gordon; Fernández-Baca, David; Sanderson, Michael J

Systematic Biology, 53(2), 299–308, 2004 Paper

Rainbow: a toolbox for phylogenetic supertree construction and analysis

Chen, Duhong; Eulenstein, Oliver; Fernández-Baca, David

Bioinformatics, 20(16), 2872–2873, 2004 Paper

MRF supertrees

Burleigh, J. Gordon; Eulenstein, Oliver; Fernández-Baca, David; Sanderson, Michael J.

Kluwer, 65–86, 2004 Paper

Quartet supertrees

Piaggio-Talice, Raul; Burleigh, J. Gordon; Eulenstein, Oliver

Kluwer, 173–192, 2004 Paper

---2003---

Obtaining maximal concatenated phylogenetic data sets from large sequence databases

Sanderson, Michael J; Driskell, Amy C; Ree, Richard H; Eulenstein, Oliver; Langley, Sasha

Molecular biology and evolution, 20(7), 1036–1042, 2003 Paper

Flipping: a supertree construction method

Chen, Duhong; Diao, Lixia; Eulenstein, Oliver; Fernández-Baca, David; Sanderson, M

DIMACS series in discrete mathematics and theoretical computer science, 61, 135–162, 2003 Paper

---2002---

Supertrees by flipping

Chen, Duhong; Eulenstein, Oliver; Fernández-Baca, David; Sanderson, Michael

International Computing and Combinatorics Conference, 391–400, 2002 Paper

---2001---

Investigating Evolutionary Lines of Least Resistance Using the Inverse Protein-Folding Problem

Schonfeld, J; Eulenstein, Oliver; Vander Velden, Kent; Naylor, Gavin JP

In Biocomputing 2002, World Scientific, 613–624, 2001 Paper

---1998---

Duplication-based measures of difference between gene and species trees

Eulenstein, Oliver; Mirkin, Boris; Vingron, Martin

Journal of Computational Biology, 5(1), 135–148, 1998 Paper

On the equivalence of two tree mapping measures

Eulenstein, Oliver; Vingron, Martin

Discrete Applied Mathematics, 88(1-3), 103–128, 1998 Paper

Towards detection of orthologues in sequence databases.

Yuan, Yan P.; Eulenstein, Oliver; Vingron, Martin; Bork, Peer

Bioinformatics (Oxford, England), 14(3), 285–289, 1998 Paper

---1997---

Comparison of Annotating Duplication, Tree Mapping, and Copying as Methods to Compare Gene Trees with Species

Eulenstein, Oliver; Mirkin, Boris; Vingron, Martin

Mathematical Hierarchies and Biology: DIMACS Workshop, November 13-15, 1996, 71, 1997 Paper

---1990---

Multi-viewing of an EDIF Netlist Schema.

Eulenstein, Oliver

Proceedings Fourth European EDIF Forum, 11–12, 1990

News

Sanket Wagle presents "The Asymetric Cluster Affinity Cost" at Recomb-CG.

Phylogenetic Diversity Statistics for all Clades in a Phylogeny, S. Grover, A. Markin,.T. Anderson, O. Eulenstein accepted by ISMB 2023.

The Asymetric Cluster Affinity Cost,S. Wagle, A. Markin, P. Gorecki, T. Anderson, O. Eulenstein accepted by Recomb-CG 2023.