16 citations · 54 across the 9 of their papers we have counts for
10 papers
Orienting Ordered Scaffolds: Complexity and Algorithms
Sergey Aganezov, Pavel Avdeyev, Nikita Alexeev +2
Despite the recent progress in genome sequencing and assembly, many of the currently available assembled genomes come in a draft form. Such draft genomes consist of a large number…
Monte Carlo goodness-of-fit tests for degree corrected and related stochastic blockmodels
Vishesh Karwa, Debdeep Pati, Sonja Petrović +6
We construct Bayesian and frequentist finite-sample goodness-of-fit tests for three different variants of the stochastic blockmodel for network data. Since all of the stochastic bl…
Combinatorial Scoring of Phylogenetic Networks
Nikita Alexeev, Max A. Alekseyev
Construction of phylogenetic trees and networks for extant species from their characters represents one of the key problems in phylogenomics. While solution to this problem is not…
Estimation of the True Evolutionary Distance under the Fragile Breakage Model
Nikita Alexeev, Max A. Alekseyev
The ability to estimate the evolutionary distance between extant genomes plays a crucial role in many phylogenomic studies. Often such estimation is based on the parsimony assumpti…
Generalized Hultman Numbers and Cycle Structures of Breakpoint Graphs
Nikita Alexeev, Anna Pologova, Max A. Alekseyev
Genome rearrangements can be modeled as -breaks, which break a genome at k positions and glue the resulting fragments in a new order. In particular, reversals, translocations, f…
A Computational Method for the Rate Estimation of Evolutionary Transpositions
Nikita Alexeev, Rustem Aidagulov, Max A. Alekseyev
Genome rearrangements are evolutionary events that shuffle genomic architectures. Most frequent genome rearrangements are reversals, translocations, fusions, and fissions. While th…