Manhattan Path-Difference Median Trees. - Alexey Markin; Oliver Eulenstein (BCB, 2016)

Path-Difference Median Trees. - Alexey Markin; Oliver Eulenstein (ISBRA, 2016)

Cophenetic Median Trees Under the Manhattan Distance. - Alexey Markin; Oliver Eulenstein (BCB, 2017)

Phylogenetic Tree Reconciliation: Mean Values for Fixed Gene Trees. - Pawel Górecki 001; Alexey Markin; Agnieszka Mykowiecka 002; Jaroslaw Paszek; Oliver Eulenstein (ISBRA, 2017)

Cophenetic Distances: A Near-Linear Time Algorithmic Framework. - Pawel Górecki 001; Alexey Markin; Oliver Eulenstein (COCOON, 2018)

Solving the Gene Duplication Feasibility Problem in Linear Time. - Alexey Markin; Venkata Sai Krishna Teja Vadali; Oliver Eulenstein (COCOON, 2018)

Robinson-Foulds Reticulation Networks. - Alexey Markin; Tavis K. Anderson; Venkata Sai Krishna Teja Vadali; Oliver Eulenstein (BCB, 2019)

Feasibility Algorithms for the Duplication-Loss Cost. - Pawel Górecki 001; Alexey Markin; Oliver Eulenstein (COCOON, 2019)

Consensus Clusters in Robinson-Foulds Reticulation Networks. - Alexey Markin; Oliver Eulenstein (WABI, 2019)

Computing Manhattan Path-Difference Median Trees: A Practical Local Search Approach. - Alexey Markin; Oliver Eulenstein (IEEE ACM Trans. Comput. Biol. Bioinform., 2019)

Efficient Local Search for Euclidean Path-Difference Median Trees. - Alexey Markin; Oliver Eulenstein (IEEE ACM Trans. Comput. Biol. Bioinform., 2019)

Cophenetic Median Trees. - Alexey Markin; Oliver Eulenstein (IEEE ACM Trans. Comput. Biol. Bioinform., 2019)

Integer Linear Programming Formulation for the Unified Duplication-Loss-Coalescence Model. - Javad Ansarifar; Alexey Markin; Pawel Górecki 001; Oliver Eulenstein (ISBRA, 2020)

Finding orthologous gene blocks in bacteria: the computational hardness of the problem and novel methods to address it. - Huy N. Nguyen; Alexey Markin; Iddo Friedberg; Oliver Eulenstein (Bioinform., 2020)

On the extremal maximum agreement subtree problem. - Alexey Markin (Discret. Appl. Math., 2020)

Taming the Duplication-Loss-Coalescence Model with Integer Linear Programming. - Jaroslaw Paszek; Alexey Markin; Pawel Górecki 001; Oliver Eulenstein (J. Comput. Biol., 2021)

Consensus of All Solutions for Intractable Phylogenetic Tree Inference. - Pawel Tabaszewski; Pawel Górecki 001; Alexey Markin; Tavis K. Anderson; Oliver Eulenstein (IEEE ACM Trans. Comput. Biol. Bioinform., 2021)

Quartet-based inference is statistically consistent under the unified duplication-loss-coalescence model. - Alexey Markin; Oliver Eulenstein (Bioinform., 2021)

CPTAM: Constituency Parse Tree Aggregation Method. - Adithya Kulkarni; Nasim Sabetpour; Alexey Markin; Oliver Eulenstein; Qi Li 012 (SDM, 2022)

RF-Net 2: fast inference of virus reassortment and hybridization networks. - Alexey Markin; Sanket Wagle; Tavis K. Anderson; Oliver Eulenstein (Bioinform., 2022)

The Asymmetric Cluster Affinity Cost. - Sanket Wagle; Alexey Markin; Pawel Górecki 001; Tavis K. Anderson; Oliver Eulenstein (RECOMB-CG, 2023)

Phylogenetic diversity statistics for all clades in a phylogeny. - Siddhant Grover; Alexey Markin; Tavis K. Anderson; Oliver Eulenstein (Bioinform., 2023)

Asymmetric Cluster-Based Measures for Comparative Phylogenetics. - Sanket Wagle; Alexey Markin; Pawel Górecki 001; Tavis K. Anderson; Oliver Eulenstein (J. Comput. Biol., 2024)