Zobrazeno 1 - 10
of 92
pro vyhledávání: '"Alexeev, Nikita"'
Publikováno v:
SN Computer Science 3 (2022), 308
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 of genomic fragments (scaffolds), whose order and/or orientation (i.e.
Externí odkaz:
http://arxiv.org/abs/1911.11190
Autor:
Karwa, Vishesh, Pati, Debdeep, Petrović, Sonja, Solus, Liam, Alexeev, Nikita, Raič, Mateja, Wilburne, Dane, Williams, Robert, Yan, Bowei
Publikováno v:
Journal of the Royal Statistical Society Series B: Statistical Methodology, Volume 86, Issue 1, February 2024, Pages 90-121
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 blockmodel variants are log-linear in form when block assignments are kn
Externí odkaz:
http://arxiv.org/abs/1612.06040
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Alexeev, Nikita, Alekseyev, Max A.
Publikováno v:
Lecture Notes in Computer Science 9797 (2016), 560-572
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 always uniquely defined and there exist multiple methods for tree/netw
Externí odkaz:
http://arxiv.org/abs/1602.02841
Autor:
Alexeev, Nikita, Alekseyev, Max A.
Publikováno v:
BMC Genomics 18:Suppl 4 (2017), 356
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 assumption, implying that the distance between two genomes can be estimated as
Externí odkaz:
http://arxiv.org/abs/1510.08002
Publikováno v:
Journal of Computational Biology 24:2 (2017), 93-105
Genome rearrangements can be modeled as $k$-breaks, which break a genome at k positions and glue the resulting fragments in a new order. In particular, reversals, translocations, fusions, and fissions are modeled as $2$-breaks, and transpositions are
Externí odkaz:
http://arxiv.org/abs/1503.05285
Publikováno v:
Lecture Notes in Computer Science 9043 (2015), pp. 471-480
Genome rearrangements are evolutionary events that shuffle genomic architectures. Most frequent genome rearrangements are reversals, translocations, fusions, and fissions. While there are some more complex genome rearrangements such as transpositions
Externí odkaz:
http://arxiv.org/abs/1501.07546
Autor:
Alexeev, Nikita, Tikhomirov, Alexander
We consider Gaussian elliptic random matrices $X$ of a size $N \times N$ with parameter $\rho$, i.e., matrices whose pairs of entries $(X_{ij}, X_{ji})$ are mutually independent Gaussian vectors, $E X_{ij} = 0$, $E X^2_{ij} = 1$ and $E X_{ij} X_{ji}
Externí odkaz:
http://arxiv.org/abs/1501.04615
Autor:
Alexeev, Nikita, Zograf, Peter
The Hultman numbers enumerate permutations whose cycle graph has a given number of alternating cycles (they are relevant to the Bafna-Pevzner approach to genome comparison and genome rearrangements). We give two new interpretations of the Hultman num
Externí odkaz:
http://arxiv.org/abs/1111.3061
We consider powers of random matrices with independent entries. Let $X_{ij}, i,j\ge 1$, be independent complex random variables with $\E X_{ij}=0$ and $\E |X_{ij}|^2=1$ and let $\mathbf X$ denote an $n\times n$ matrix with $[\mathbf X]_{ij}=X_{ij}$,
Externí odkaz:
http://arxiv.org/abs/1012.2743