Alexey Markin

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 24

Top Topics

Top Venues

IEEE ACM Trans. Comput. Biol. Bioinform.

Publications

Sanket Wagle, Alexey Markin, Pawel Górecki, Tavis K. Anderson, Oliver Eulenstein
Asymmetric Cluster-Based Measures for Comparative Phylogenetics. J. Comput. Biol. 31 (4) (2024)
Siddhant Grover, Alexey Markin, Tavis K. Anderson, Oliver Eulenstein
Phylogenetic diversity statistics for all clades in a phylogeny. Bioinform. 39 (Supplement-1) (2023)
Sanket Wagle, Alexey Markin, Pawel Górecki, Tavis K. Anderson, Oliver Eulenstein
The Asymmetric Cluster Affinity Cost. RECOMB-CG (2023)
Adithya Kulkarni, Nasim Sabetpour, Alexey Markin, Oliver Eulenstein, Qi Li
CPTAM: Constituency Parse Tree Aggregation Method. CoRR (2022)
Adithya Kulkarni, Nasim Sabetpour, Alexey Markin, Oliver Eulenstein, Qi Li
CPTAM: Constituency Parse Tree Aggregation Method. SDM (2022)
Alexey Markin, Sanket Wagle, Tavis K. Anderson, Oliver Eulenstein
RF-Net 2: fast inference of virus reassortment and hybridization networks. Bioinform. 38 (8) (2022)
Alexey Markin, Oliver Eulenstein
Quartet-based inference is statistically consistent under the unified duplication-loss-coalescence model. Bioinform. 37 (22) (2021)
Pawel Tabaszewski, Pawel Górecki, Alexey Markin, Tavis K. Anderson, Oliver Eulenstein
Consensus of All Solutions for Intractable Phylogenetic Tree Inference. IEEE ACM Trans. Comput. Biol. Bioinform. 18 (1) (2021)
Jaroslaw Paszek, Alexey Markin, Pawel Górecki, Oliver Eulenstein
Taming the Duplication-Loss-Coalescence Model with Integer Linear Programming. J. Comput. Biol. 28 (8) (2021)
Javad Ansarifar, Alexey Markin, Pawel Górecki, Oliver Eulenstein
Integer Linear Programming Formulation for the Unified Duplication-Loss-Coalescence Model. ISBRA (2020)
Alexey Markin
On the extremal maximum agreement subtree problem. Discret. Appl. Math. 285 (2020)
Alexey Markin, Tavis K. Anderson, Venkata Sai Krishna Teja Vadali, Oliver Eulenstein
Robinson-Foulds Reticulation Networks. BCB (2019)
Alexey Markin, Oliver Eulenstein
Cophenetic Median Trees. IEEE ACM Trans. Comput. Biol. Bioinform. 16 (5) (2019)
Alexey Markin, Oliver Eulenstein
Consensus Clusters in Robinson-Foulds Reticulation Networks. WABI (2019)
Alexey Markin, Oliver Eulenstein
Efficient Local Search for Euclidean Path-Difference Median Trees. IEEE ACM Trans. Comput. Biol. Bioinform. 16 (4) (2019)
Pawel Górecki, Alexey Markin, Oliver Eulenstein
Feasibility Algorithms for the Duplication-Loss Cost. COCOON (2019)
Alexey Markin, Oliver Eulenstein
Computing Manhattan Path-Difference Median Trees: A Practical Local Search Approach. IEEE ACM Trans. Comput. Biol. Bioinform. 16 (4) (2019)
Alexey Markin, Venkata Sai Krishna Teja Vadali, Oliver Eulenstein
Solving the Gene Duplication Feasibility Problem in Linear Time. COCOON (2018)
Pawel Górecki, Alexey Markin, Oliver Eulenstein
Cophenetic Distances: A Near-Linear Time Algorithmic Framework. COCOON (2018)
Alexey Markin
On the Extremal Maximum Agreement Subtree Problem. CoRR (2018)
Pawel Górecki, Alexey Markin, Agnieszka Mykowiecka, Jaroslaw Paszek, Oliver Eulenstein
Phylogenetic Tree Reconciliation: Mean Values for Fixed Gene Trees. ISBRA (2017)
Alexey Markin, Oliver Eulenstein
Cophenetic Median Trees Under the Manhattan Distance. BCB (2017)
Alexey Markin, Oliver Eulenstein
Manhattan Path-Difference Median Trees. BCB (2016)
Alexey Markin, Oliver Eulenstein
Path-Difference Median Trees. ISBRA (2016)