default search action
Nikita Alexeev
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j9]Alexey Zabelkin, Yulia Yakovleva, Olga Bochkareva, Nikita Alexeev:
PaReBrick: PArallel REarrangements and BReaks identification toolkit. Bioinform. 38(2): 357-363 (2022) - [j8]Sergey Aganezov, Pavel Avdeyev, Nikita Alexeev, Yongwu Rong, Max A. Alekseyev:
Orienting Ordered Scaffolds: Complexity and Algorithms. SN Comput. Sci. 3(4): 308 (2022) - [c7]Natalia Petukhova, Alexey Zabelkin, Vitaly Dravgelis, Sergey Aganezov, Nikita Alexeev:
Chromothripsis Rearrangements Are Informed by 3D-Genome Organization. RECOMB-CG 2022: 221-231 - 2020
- [j7]Pavel Avdeyev, Nikita Alexeev, Yongwu Rong, Max A. Alekseyev:
A unified ILP framework for core ancestral genome reconstruction problems. Bioinform. 36(10): 2993-3003 (2020) - [j6]Nikita Alexeev, Javlon E. Isomurodov, Vladimir Sukhov, Gennady Korotkevich, Alexey A. Sergushichev:
Markov chain Monte Carlo for active module identification problem. BMC Bioinform. 21-S(6): 261 (2020)
2010 – 2019
- 2019
- [j5]Sergey Aganezov, Ilya Zban, Vitaly Aksenov, Nikita Alexeev, Michael C. Schatz:
Recovering rearranged cancer chromosomes from karyotype graphs. BMC Bioinform. 20-S(20): 641 (2019) - [i2]Sergey Aganezov, Pavel Avdeyev, Nikita Alexeev, Yongwu Rong, Max A. Alekseyev:
Orienting Ordered Scaffolds: Complexity and Algorithms. CoRR abs/1911.11190 (2019) - 2018
- [j4]Nikita Alexeev, Max A. Alekseyev:
Combinatorial Scoring of Phylogenetic Trees and Networks Based on Homoplasy-Free Characters. J. Comput. Biol. 25(11): 1203-1219 (2018) - [c6]Alexey Zabelkin, Nikita Alexeev:
Estimation of the True Evolutionary Distance Under the INFER Model. RECOMB-CG 2018: 72-87 - 2017
- [j3]Nikita Alexeev, Anna Pologova, Max A. Alekseyev:
Generalized Hultman Numbers and Cycle Structures of Breakpoint Graphs. J. Comput. Biol. 24(2): 93-105 (2017) - [c5]Pavel Avdeyev, Nikita Alexeev, Yongwu Rong, Max A. Alekseyev:
A Unified ILP Framework for Genome Median, Halving, and Aliquoting Problems Under DCJ. RECOMB-CG 2017: 156-178 - 2016
- [j2]Nikita Alexeev, Pavel Avdeyev, Max A. Alekseyev:
Comparative genomics meets topology: a novel view on genome median and halving problems. BMC Bioinform. 17(S-14): 213-223 (2016) - [c4]Nikita Alexeev, Max A. Alekseyev:
Combinatorial Scoring of Phylogenetic Networks. COCOON 2016: 560-572 - [i1]Nikita Alexeev, Max A. Alekseyev:
Combinatorial Scoring of Phylogenetic Networks. CoRR abs/1602.02841 (2016) - 2015
- [c3]Nikita Alexeev, Anna Pologova, Max A. Alekseyev:
Generalized Hultman Numbers and the Distribution of Multi-break Distances. AlCoB 2015: 3-12 - [c2]Nikita Alexeev, Max A. Alekseyev:
Estimation of the true evolutionary distance under the fragile breakage model. ICCABS 2015: 1 - [c1]Nikita Alexeev, Rustem Aidagulov, Max A. Alekseyev:
A Computational Method for the Rate Estimation of Evolutionary Transpositions. IWBBIO (1) 2015: 471-480 - 2014
- [j1]Nikita Alexeev, Peter Zograf:
Random Matrix Approach to the Distribution of Genomic Distance. J. Comput. Biol. 21(8): 622-631 (2014)
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-04-24 23:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint