| Path-difference median trees A Markin, O Eulenstein International Symposium on Bioinformatics Research and Applications, 211-223, 2016 | 7 | 2016 |
| Quartet-based inference methods are statistically consistent under the unified duplication-loss-coalescence model A Markin, O Eulenstein arXiv preprint arXiv:2004.04299, 2020 | 5 | 2020 |
| Manhattan path-difference median trees A Markin, O Eulenstein Proceedings of the 7th ACM International Conference on Bioinformatics …, 2016 | 5 | 2016 |
| On the extremal maximum agreement subtree problem A Markin Discrete Applied Mathematics 285, 612-620, 2020 | 3 | 2020 |
| Robinson-foulds reticulation networks A Markin, TK Anderson, VSKT Vadali, O Eulenstein Proceedings of the 10th ACM International Conference on Bioinformatics …, 2019 | 3 | 2019 |
| Cophenetic median trees under the manhattan distance A Markin, O Eulenstein Proceedings of the 8th ACM International Conference on Bioinformatics …, 2017 | 3 | 2017 |
| Computing Manhattan path-difference median trees: A practical local search approach A Markin, O Eulenstein IEEE/ACM transactions on computational biology and bioinformatics 16 (4 …, 2017 | 3 | 2017 |
| Efficient local search for Euclidean path-difference median trees A Markin, O Eulenstein IEEE/ACM transactions on computational biology and bioinformatics 16 (4 …, 2017 | 2 | 2017 |
| Consensus of all Solutions for Intractable Phylogenetic Tree Inference P Tabaszewski, P Górecki, A Markin, T Anderson, O Eulenstein IEEE/ACM transactions on computational biology and bioinformatics, 2019 | 1 | 2019 |
| Consensus clusters in robinson-foulds reticulation networks A Markin, O Eulenstein 19th International Workshop on Algorithms in Bioinformatics (WABI 2019), 2019 | 1 | 2019 |
| Cophenetic median trees A Markin, O Eulenstein IEEE/ACM transactions on computational biology and bioinformatics 16 (5 …, 2018 | 1 | 2018 |
| Solving the gene duplication feasibility problem in linear time A Markin, VSKT Vadali, O Eulenstein International Computing and Combinatorics Conference, 378-390, 2018 | 1 | 2018 |
| Cophenetic distances: A near-linear time algorithmic framework P Górecki, A Markin, O Eulenstein International Computing and Combinatorics Conference, 168-179, 2018 | 1 | 2018 |
| Finding orthologous gene blocks in bacteria: the computational hardness of the problem and novel methods to address it HN Nguyen, A Markin, I Friedberg, O Eulenstein Bioinformatics 36 (Supplement_2), i668-i674, 2020 | | 2020 |
| Integer Linear Programming Formulation for the Unified Duplication-Loss-Coalescence Model J Ansarifar, A Markin, P Górecki, O Eulenstein International Symposium on Bioinformatics Research and Applications, 229-242, 2020 | | 2020 |
| Exact median-tree inference for unrooted reconciliation costs P Górecki, A Markin, O Eulenstein BMC Evolutionary Biology 20 (1), 1-15, 2020 | | 2020 |
| Phylogenetic comparison measurements and their application towards the accurate inference of evolutionary histories A Markin | | 2020 |
| Feasibility Algorithms for the Duplication-Loss Cost P Górecki, A Markin, O Eulenstein International Computing and Combinatorics Conference, 206-218, 2019 | | 2019 |
| Phylogenetic Tree Reconciliation: Mean Values for Fixed Gene Trees P Górecki, A Markin, A Mykowiecka, J Paszek, O Eulenstein International Symposium on Bioinformatics Research and Applications, 234-245, 2017 | | 2017 |
