Alexey Markin

According to our database, Alexey Markin authored at least 21 papers between 2016 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

Phylogenetic diversity statistics for all clades in a phylogeny.

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

Bioinform., 2023

The Asymmetric Cluster Affinity Cost.

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

Proceedings of the Comparative Genomics - 20th International Conference, 2023

2022

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

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

Bioinform., 2022

CPTAM: Constituency Parse Tree Aggregation Method.

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

Proceedings of the 2022 SIAM International Conference on Data Mining, 2022

2021

Quartet-based inference is statistically consistent under the unified duplication-loss-coalescence model.

Alexey Markin, Oliver Eulenstein

Bioinform., November, 2021

Consensus of All Solutions for Intractable Phylogenetic Tree Inference.

Pawel Tabaszewski, Pawel Górecki, Alexey Markin, Tavis K. Anderson, Oliver Eulenstein

IEEE ACM Trans. Comput. Biol. Bioinform., 2021

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

Jaroslaw Paszek, Alexey Markin, Pawel Górecki, Oliver Eulenstein

J. Comput. Biol., 2021

2020

On the extremal maximum agreement subtree problem.

Alexey Markin

Discret. Appl. Math., 2020

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

Javad Ansarifar, Alexey Markin, Pawel Górecki, Oliver Eulenstein

Proceedings of the Bioinformatics Research and Applications - 16th International Symposium, 2020

2019

Cophenetic Median Trees.

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

Computing Manhattan Path-Difference Median Trees: A Practical Local Search Approach.

Alexey Markin, Oliver Eulenstein

IEEE ACM Trans. Comput. Biol. Bioinform., 2019

Consensus Clusters in Robinson-Foulds Reticulation Networks.

Alexey Markin, Oliver Eulenstein

Proceedings of the 19th International Workshop on Algorithms in Bioinformatics, 2019

Feasibility Algorithms for the Duplication-Loss Cost.

Pawel Górecki, Alexey Markin, Oliver Eulenstein

Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

Robinson-Foulds Reticulation Networks.

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

Proceedings of the 10th ACM International Conference on Bioinformatics, 2019

2018

Solving the Gene Duplication Feasibility Problem in Linear Time.

Alexey Markin, Venkata Sai Krishna Teja Vadali, Oliver Eulenstein

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

Cophenetic Distances: A Near-Linear Time Algorithmic Framework.

Pawel Górecki, Alexey Markin, Oliver Eulenstein

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017

Phylogenetic Tree Reconciliation: Mean Values for Fixed Gene Trees.

Pawel Górecki, Alexey Markin, Agnieszka Mykowiecka, Jaroslaw Paszek, Oliver Eulenstein

Proceedings of the Bioinformatics Research and Applications - 13th International Symposium, 2017

Cophenetic Median Trees Under the Manhattan Distance.

Alexey Markin, Oliver Eulenstein

Proceedings of the 8th ACM International Conference on Bioinformatics, 2017

2016

Path-Difference Median Trees.

Alexey Markin, Oliver Eulenstein

Proceedings of the Bioinformatics Research and Applications - 12th International Symposium, 2016

Manhattan Path-Difference Median Trees.

Alexey Markin, Oliver Eulenstein

Proceedings of the 7th ACM International Conference on Bioinformatics, 2016