Alexey Markin

Orcid: 0000-0003-3280-9050

According to our database1, Alexey Markin authored at least 26 papers between 2016 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2025
Phylo-rs: an extensible phylogenetic analysis library in rust.
BMC Bioinform., December, 2025

Ordered Leaf Attachment (OLA) Vectors can Identify Reticulation Events even in Multifurcated Trees.
CoRR, September, 2025

Computing generalized cophenetic distances under all Lp norms: A near-linear time algorithmic framework.
PLoS Comput. Biol., 2025

2024
Asymmetric Cluster-Based Measures for Comparative Phylogenetics.
J. Comput. Biol., 2024

2023
Phylogenetic diversity statistics for all clades in a phylogeny.
Bioinform., 2023

The Asymmetric Cluster Affinity Cost.
Proceedings of the Comparative Genomics - 20th International Conference, 2023

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

CPTAM: Constituency Parse Tree Aggregation Method.
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.
Bioinform., November, 2021

Consensus of All Solutions for Intractable Phylogenetic Tree Inference.
IEEE ACM Trans. Comput. Biol. Bioinform., 2021

Taming the Duplication-Loss-Coalescence Model with Integer Linear Programming.
J. Comput. Biol., 2021

2020
On the extremal maximum agreement subtree problem.
Discret. Appl. Math., 2020

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

Integer Linear Programming Formulation for the Unified Duplication-Loss-Coalescence Model.
Proceedings of the Bioinformatics Research and Applications - 16th International Symposium, 2020

2019
Cophenetic Median Trees.
IEEE ACM Trans. Comput. Biol. Bioinform., 2019

Efficient Local Search for Euclidean Path-Difference Median Trees.
IEEE ACM Trans. Comput. Biol. Bioinform., 2019

Computing Manhattan Path-Difference Median Trees: A Practical Local Search Approach.
IEEE ACM Trans. Comput. Biol. Bioinform., 2019

Consensus Clusters in Robinson-Foulds Reticulation Networks.
Proceedings of the 19th International Workshop on Algorithms in Bioinformatics, 2019

Feasibility Algorithms for the Duplication-Loss Cost.
Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

Robinson-Foulds Reticulation Networks.
Proceedings of the 10th ACM International Conference on Bioinformatics, 2019

2018
Solving the Gene Duplication Feasibility Problem in Linear Time.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

Cophenetic Distances: A Near-Linear Time Algorithmic Framework.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017
Phylogenetic Tree Reconciliation: Mean Values for Fixed Gene Trees.
Proceedings of the Bioinformatics Research and Applications - 13th International Symposium, 2017

Cophenetic Median Trees Under the Manhattan Distance.
Proceedings of the 8th ACM International Conference on Bioinformatics, 2017

2016
Path-Difference Median Trees.
Proceedings of the Bioinformatics Research and Applications - 12th International Symposium, 2016

Manhattan Path-Difference Median Trees.
Proceedings of the 7th ACM International Conference on Bioinformatics, 2016


  Loading...