501 citations · 581 across the 27 of their papers we have counts for
7 papers · 1 filter
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…
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…
On pairwise distances and median score of three genomes under DCJ
Sergey Aganezov, Max A. Alekseyev
In comparative genomics, the rearrangement distance between two genomes (equal the minimal number of genome rearrangements required to transform them into a single genome) is often…
Weighted genomic distance can hardly impose a bound on the proportion of transpositions
Shuai Jiang, Max A. Alekseyev
Genomic distance between two genomes, i.e., the smallest number of genome rearrangements required to transform one genome into the other, is often used as a measure of evolutionary…