default search action
Alexey Markin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j10]Sanket Wagle
, Alexey Markin, Pawel Górecki, Tavis K. Anderson, Oliver Eulenstein:
Asymmetric Cluster-Based Measures for Comparative Phylogenetics. J. Comput. Biol. 31(4): 312-327 (2024) - 2023
- [j9]Siddhant Grover, Alexey Markin, Tavis K. Anderson
Phylogenetic diversity statistics for all clades in a phylogeny. Bioinform. 39(Supplement-1): 177-184 (2023) - [c12]Sanket Wagle, Alexey Markin, Pawel Górecki, Tavis K. Anderson, Oliver Eulenstein:
The Asymmetric Cluster Affinity Cost. RECOMB-CG 2023: 131-145 - 2022
- [j8]Alexey Markin
RF-Net 2: fast inference of virus reassortment and hybridization networks. Bioinform. 38(8): 2144-2152 (2022) - [c11]Adithya Kulkarni, Nasim Sabetpour, Alexey Markin, Oliver Eulenstein, Qi Li
CPTAM: Constituency Parse Tree Aggregation Method. SDM 2022: 630-638 - [i2]Adithya Kulkarni, Nasim Sabetpour, Alexey Markin, Oliver Eulenstein, Qi Li:
CPTAM: Constituency Parse Tree Aggregation Method. CoRR abs/2201.07905 (2022) - 2021
- [j7]Alexey Markin
Quartet-based inference is statistically consistent under the unified duplication-loss-coalescence model. Bioinform. 37(22): 4064-4074 (2021) - [j6]Jaroslaw Paszek
Taming the Duplication-Loss-Coalescence Model with Integer Linear Programming. J. Comput. Biol. 28(8): 758-773 (2021) - [j5]Pawel Tabaszewski, Pawel Górecki
Consensus of All Solutions for Intractable Phylogenetic Tree Inference. IEEE ACM Trans. Comput. Biol. Bioinform. 18(1): 149-161 (2021) - 2020
- [j4]Alexey Markin
On the extremal maximum agreement subtree problem. Discret. Appl. Math. 285: 612-620 (2020) - [c10]Javad Ansarifar, Alexey Markin, Pawel Górecki
Integer Linear Programming Formulation for the Unified Duplication-Loss-Coalescence Model. ISBRA 2020: 229-242
2010 – 2019
- 2019
- [j3]Alexey Markin
Computing Manhattan Path-Difference Median Trees: A Practical Local Search Approach. IEEE ACM Trans. Comput. Biol. Bioinform. 16(4): 1063-1076 (2019) - [j2]Alexey Markin
Efficient Local Search for Euclidean Path-Difference Median Trees. IEEE ACM Trans. Comput. Biol. Bioinform. 16(4): 1374-1385 (2019) - [j1]Alexey Markin
Cophenetic Median Trees. IEEE ACM Trans. Comput. Biol. Bioinform. 16(5): 1459-1470 (2019) - [c9]Alexey Markin, Tavis K. Anderson, Venkata Sai Krishna Teja Vadali, Oliver Eulenstein:
Robinson-Foulds Reticulation Networks. BCB 2019: 77-86 - [c8]Pawel Górecki
Feasibility Algorithms for the Duplication-Loss Cost. COCOON 2019: 206-218 - [c7]Alexey Markin
Consensus Clusters in Robinson-Foulds Reticulation Networks. WABI 2019: 12:1-12:12 - 2018
- [c6]Pawel Górecki
Cophenetic Distances: A Near-Linear Time Algorithmic Framework. COCOON 2018: 168-179 - [c5]Alexey Markin, Venkata Sai Krishna Teja Vadali, Oliver Eulenstein:
Solving the Gene Duplication Feasibility Problem in Linear Time. COCOON 2018: 378-390 - [i1]Alexey Markin:
On the Extremal Maximum Agreement Subtree Problem. CoRR abs/1812.06951 (2018) - 2017
- [c4]Alexey Markin, Oliver Eulenstein:
Cophenetic Median Trees Under the Manhattan Distance. BCB 2017: 194-202 - [c3]Pawel Górecki
Phylogenetic Tree Reconciliation: Mean Values for Fixed Gene Trees. ISBRA 2017: 234-245 - 2016
- [c2]Alexey Markin, Oliver Eulenstein:
Manhattan Path-Difference Median Trees. BCB 2016: 404-413 - [c1]Alexey Markin, Oliver Eulenstein:
Path-Difference Median Trees. ISBRA 2016: 211-223
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: