Zobrazeno 1 - 10
of 123
pro vyhledávání: '"Bankevich A"'
Autor:
Bankevich, S., Nazarov, A. I.
We give necessary and sufficient conditions for the P\'olya--Szeg\"o type inequality with variable exponent of summability.
Comment: 12 pages
Comment: 12 pages
Externí odkaz:
http://arxiv.org/abs/1711.05841
Autor:
Shlemov, Alexander, Bankevich, Sergey, Bzikadze, Andrey, Turchaninova, Maria A., Safonova, Yana, Pevzner, Pavel A.
Transforming error-prone immunosequencing datasets into antibody repertoires is a fundamental problem in immunogenomics, and a prerequisite for studies of immune responses. Although various repertoire reconstruction algorithms were released in the la
Externí odkaz:
http://arxiv.org/abs/1704.07184
Motivation: The analysis of antibodies and T-cell receptors (TCRs) concentrations in serum is a fundamental problem in immunoinformatics. Repertoire construction is a preliminary step of analysis of clonal lineages, understanding of immune response d
Externí odkaz:
http://arxiv.org/abs/1604.02193
Autor:
Tatiana Dvorkina, Anton Bankevich, Alexei Sorokin, Fan Yang, Boahemaa Adu-Oppong, Ryan Williams, Keith Turner, Pavel A. Pevzner
Publikováno v:
Microbiome, Vol 9, Iss 1, Pp 1-14 (2021)
Abstract Background Since the prolonged use of insecticidal proteins has led to toxin resistance, it is important to search for novel insecticidal protein genes (IPGs) that are effective in controlling resistant insect populations. IPGs are usually e
Externí odkaz:
https://doaj.org/article/c4c49f66d85e4db4a8fcdb3e5ab70d7f
Autor:
Bankevich, S. V., Nazarov, A. I.
We consider the Polya--Szeg\"o type weighted inequality. We prove this inequality for monotone rearrangement and for Steiner's symmetrization.
Comment: 22 pages. Russian version of this preprint is published in November 2013 and available at htt
Comment: 22 pages. Russian version of this preprint is published in November 2013 and available at htt
Externí odkaz:
http://arxiv.org/abs/1402.3006
Autor:
Bankevich, Anton, Karpov, Dmitri
Publikováno v:
Journal of Mathematical Sciences, Volume 184, Issue 5 (2012), pp. 564-572
We prove that every connected graph with $s$ vertices of degree not 2 has a spanning tree with at least ${1\over 4}(s-2)+2$ leaves. Let $G$ be a be a connected graph of girth $g$ with $v>1$ vertices. Let maximal chain of successively adjacent vertice
Externí odkaz:
http://arxiv.org/abs/1111.3266
Autor:
Jon G. Sanders, Sergey Nurk, Rodolfo A. Salido, Jeremiah Minich, Zhenjiang Z. Xu, Qiyun Zhu, Cameron Martino, Marcus Fedarko, Timothy D. Arthur, Feng Chen, Brigid S. Boland, Greg C. Humphrey, Caitriona Brennan, Karenina Sanders, James Gaffney, Kristen Jepsen, Mahdieh Khosroheidari, Cliff Green, Marlon Liyanage, Jason W. Dang, Vanessa V. Phelan, Robert A. Quinn, Anton Bankevich, John T. Chang, Tariq M. Rana, Douglas J. Conrad, William J. Sandborn, Larry Smarr, Pieter C. Dorrestein, Pavel A. Pevzner, Rob Knight
Publikováno v:
Genome Biology, Vol 20, Iss 1, Pp 1-14 (2019)
Abstract As metagenomic studies move to increasing numbers of samples, communities like the human gut may benefit more from the assembly of abundant microbes in many samples, rather than the exhaustive assembly of fewer samples. We term this approach
Externí odkaz:
https://doaj.org/article/42e8537276ff4a9bba279cd526759a65
Autor:
Anton Bankevich, Ryan J. Williams, Keith H. Turner, Tatiana Dvorkina, Fan Yang, Boahemaa Adu-Oppong, Pavel A. Pevzner, Alexei Sorokin
Publikováno v:
Microbiome, Vol 9, Iss 1, Pp 1-14 (2021)
Microbiome, vol 9, iss 1
Microbiome
Microbiome, vol 9, iss 1
Microbiome
Background Since the prolonged use of insecticidal proteins has led to toxin resistance, it is important to search for novel insecticidal protein genes (IPGs) that are effective in controlling resistant insect populations. IPGs are usually encoded in
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.
Publikováno v:
Nature biotechnology. 40(7)
Although most existing genome assemblers are based on de Bruijn graphs, the construction of these graphs for large genomes and large k-mer sizes has remained elusive. This algorithmic challenge has become particularly pressing with the emergence of l