Anatolii Zaikovskii
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Anatolii Zaikovskii has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- Sergei O. Ivanov
Laboratory of Modern Algebra and Applications, St. Petersburg State University, Saint Petersburg, Russia
6 shared publications - Roman Mikhailov
St. Petersburg State University
2 shared publications - A. I. Generalov
St.Petersburg State University, St. Petersburg, Russia
1 shared publication Aleksandr Petiushko
Lomonosov MSU
1 shared publication- Anastasia V. Kalinina
Laboratory of Proteomics and Metabolomics, International Tomography Center SB RAS, Institutskaya Str. 3a, Novosibirsk 630090, Russia
1 shared publication - Arsenty D. Melnikov
Laboratory of Proteomics and Metabolomics, International Tomography Center SB RAS, Institutskaya Str. 3a, Novosibirsk 630090, Russia
1 shared publication
Latest Publications
- Open Access
- 17 October 2023
- Published by MDPI AG in Metabolites
- Vol. 13 (10) , 1088
Animal Metabolite Database: Metabolite Concentrations in Animal Tissues and Convenient Comparison of Quantitative Metabolomic Data
The Animal Metabolite Database (AMDB, https://amdb.online) is a freely accessible database with built-in statistical analysis tools, allowing one to browse and compare quantitative metabolomics data and raw NMR and MS data, as well as sample metadata, with a focus on the metabolite concentrations rather than on the raw data itself. AMDB also functions as a platform for the metabolomics community, providing convenient deposition and exchange of quantitative metabolomic data. To date, the majority of the data in AMDB relate to the metabolite content of the eye lens and blood of vertebrates, primarily wild species from Siberia, Russia and laboratory rodents. However, data on other tissues (muscle, heart, liver, brain, and more) are also present, and the list of species and tissues is constantly growing. Typically, every sample in AMDB contains concentrations of 60–90 of the most abundant metabolites, provided in nanomoles per gram of wet tissue weight (nmol/g). We believe that AMDB will become a widely used tool in the community, as typical metabolite baseline concentrations in tissues of animal models will aid in a wide variety of fundamental and applied scientific fields, including, but not limited to, animal modeling of human diseases, assessment of medical formulations, and evolutionary and environmental studies.
- 17 October 2023
- Published by MDPI AG in Metabolites
- Vol. 13 (10) , 1088
Open AccessAnimal Metabolite Database: Metabolite Concentrations in Animal Tissues and Convenient Comparison of Quantitative Metabolomic Data
The Animal Metabolite Database (AMDB, https://amdb.online) is a freely accessible database with built-in statistical analysis tools, allowing one to browse and compare quantitative metabolomics data and raw NMR and MS data, as well as sample metadata, with a focus on the metabolite concentrations rather than on the raw data itself. AMDB also functions as a platform for the metabolomics community, providing convenient deposition and exchange of quantitative metabolomic data. To date, the majority of the data in AMDB relate to the metabolite content of the eye lens and blood of vertebrates, primarily wild species from Siberia, Russia and laboratory rodents. However, data on other tissues (muscle, heart, liver, brain, and more) are also present, and the list of species and tissues is constantly growing. Typically, every sample in AMDB contains concentrations of 60–90 of the most abundant metabolites, provided in nanomoles per gram of wet tissue weight (nmol/g). We believe that AMDB will become a widely used tool in the community, as typical metabolite baseline concentrations in tissues of animal models will aid in a wide variety of fundamental and applied scientific fields, including, but not limited to, animal modeling of human diseases, assessment of medical formulations, and evolutionary and environmental studies.
- Open Access
Quadric Hypersurface Intersection for Manifold Learning in Feature Space
The knowledge that data lies close to a particular submanifold of the ambient Euclidean space may be useful in a number of ways. For instance, one may want to automatically mark any point far away from the submanifold as an outlier or to use the geometry to come up with a better distance metric. Manifold learning problems are often posed in a very high dimension, e.g. for spaces of images or spaces of words. Today, with deep representation learning on the rise in areas such as computer vision and natural language processing, many problems of this kind may be transformed into problems of moderately high dimension, typically of the order of hundreds. Motivated by this, we propose a manifold learning technique suitable for moderately high dimension and large datasets. The manifold is learned from the training data in the form of an intersection of quadric hypersurfaces -- simple but expressive objects. At test time, this manifold can be used to introduce a computationally efficient outlier score for arbitrary new data points and to improve a given similarity metric by incorporating the learned geometric structure into it.
Open AccessQuadric Hypersurface Intersection for Manifold Learning in Feature Space
The knowledge that data lies close to a particular submanifold of the ambient Euclidean space may be useful in a number of ways. For instance, one may want to automatically mark any point far away from the submanifold as an outlier or to use the geometry to come up with a better distance metric. Manifold learning problems are often posed in a very high dimension, e.g. for spaces of images or spaces of words. Today, with deep representation learning on the rise in areas such as computer vision and natural language processing, many problems of this kind may be transformed into problems of moderately high dimension, typically of the order of hundreds. Motivated by this, we propose a manifold learning technique suitable for moderately high dimension and large datasets. The manifold is learned from the training data in the form of an intersection of quadric hypersurfaces -- simple but expressive objects. At test time, this manifold can be used to introduce a computationally efficient outlier score for arbitrary new data points and to improve a given similarity metric by incorporating the learned geometric structure into it.
- Open Access
On homology of Lie algebras over commutative rings
We study five different types of the homology of a Lie algebra over a commutative ring which are naturally isomorphic over fields. We show that they are not isomorphic over commutative rings, even over $\mathbb Z,$ and study connections between them. In particular, we show that they are naturally isomorphic in the case of a Lie algebra which is flat as a module. As an auxiliary result we prove that the Koszul complex of a module $M$ over a principal ideal domain that connects the exterior and the symmetric powers $0\to \Lambda^n M\to M \otimes \Lambda^{n-1} M \to \dots \to S^{n-1}M \otimes M \to S^nM\to 0 $ is purely acyclic.Open AccessOn homology of Lie algebras over commutative rings
We study five different types of the homology of a Lie algebra over a commutative ring which are naturally isomorphic over fields. We show that they are not isomorphic over commutative rings, even over $\mathbb Z,$ and study connections between them. In particular, we show that they are naturally isomorphic in the case of a Lie algebra which is flat as a module. As an auxiliary result we prove that the Koszul complex of a module $M$ over a principal ideal domain that connects the exterior and the symmetric powers $0\to \Lambda^n M\to M \otimes \Lambda^{n-1} M \to \dots \to S^{n-1}M \otimes M \to S^nM\to 0 $ is purely acyclic. - 14 January 2021
- Published by Springer Nature in Journal of Mathematical Sciences
- Vol. 252 (6) , 794-803
MOD-2 (CO)homology of an Abelian Group
- 14 January 2021
- Published by Springer Nature in Journal of Mathematical Sciences
- Vol. 252 (6) , 794-803
MOD-2 (CO)homology of an Abelian Group
- 1 October 2020
- Published by Elsevier in Journal of Algebra
- Vol. 560, 1092-1106
Homological properties of parafree Lie algebras
- 1 October 2020
- Published by Elsevier in Journal of Algebra
- Vol. 560, 1092-1106
Homological properties of parafree Lie algebras
- Open Access
Homological properties of parafree Lie algebras
In this paper, an explicit construction of a countable parafree Lie algebra over $\mathbb Z/2$ with nonzero second homology is given. It is also shown that the cohomological dimension of the pronilpotent completion of a free noncyclic finitely generated Lie algebra over $\mathbb Z$ is greater than two. Moreover, it is proven that there exists a countable parafree group with nontrivial $H_2$.Open AccessHomological properties of parafree Lie algebras
In this paper, an explicit construction of a countable parafree Lie algebra over $\mathbb Z/2$ with nonzero second homology is given. It is also shown that the cohomological dimension of the pronilpotent completion of a free noncyclic finitely generated Lie algebra over $\mathbb Z$ is greater than two. Moreover, it is proven that there exists a countable parafree group with nontrivial $H_2$. - Open Access
Mod-2 (co)homology of an abelian group
It is known that for a prime $p\ne 2$ there is the following natural description of the homology algebra of an abelian group $H_*(A,\mathbb F_p)\cong \Lambda(A/p)\otimes \Gamma({}_pA)$ and for finitely generated abelian groups there is the following description of the cohomology algebra of $H^*(A,\mathbb F_p)\cong \Lambda((A/p)^\vee)\otimes {\sf Sym}(({}_pA)^\vee).$ We prove that there are no such descriptions for $p=2$ that `depend' only on $A/2$ and ${}_2A$ but we provide natural descriptions of $H_*(A,\mathbb F_2)$ and $H^*(A,\mathbb F_2)$ that `depend' on $A/2,$ ${}_2A$ and a linear map $\tilde \beta:{}_2A\to A/2.$ Moreover, we prove that there is a filtration by subfunctors on $H_n(A,\mathbb F_2)$ whose quotients are $\Lambda^{n-2i}(A/2)\otimes \Gamma^i({}_2A)$ and that for finitely generated abelian groups there is a natural filtration on $H^n(A,\mathbb F_2)$ whose quotients are $ \Lambda^{n-2i}((A/2)^\vee)\otimes {\sf Sym}^i(({}_2A)^\vee).$Open AccessMod-2 (co)homology of an abelian group
It is known that for a prime $p\ne 2$ there is the following natural description of the homology algebra of an abelian group $H_*(A,\mathbb F_p)\cong \Lambda(A/p)\otimes \Gamma({}_pA)$ and for finitely generated abelian groups there is the following description of the cohomology algebra of $H^*(A,\mathbb F_p)\cong \Lambda((A/p)^\vee)\otimes {\sf Sym}(({}_pA)^\vee).$ We prove that there are no such descriptions for $p=2$ that `depend' only on $A/2$ and ${}_2A$ but we provide natural descriptions of $H_*(A,\mathbb F_2)$ and $H^*(A,\mathbb F_2)$ that `depend' on $A/2,$ ${}_2A$ and a linear map $\tilde \beta:{}_2A\to A/2.$ Moreover, we prove that there is a filtration by subfunctors on $H_n(A,\mathbb F_2)$ whose quotients are $\Lambda^{n-2i}(A/2)\otimes \Gamma^i({}_2A)$ and that for finitely generated abelian groups there is a natural filtration on $H^n(A,\mathbb F_2)$ whose quotients are $ \Lambda^{n-2i}((A/2)^\vee)\otimes {\sf Sym}^i(({}_2A)^\vee).$ - 13 June 2018
- Published by Springer Nature in Journal of Mathematical Sciences
- Vol. 232 (5) , 635-646
On Derived Equivalence of Algebras of Semidihedral Type with Two Simple Modules
- 13 June 2018
- Published by Springer Nature in Journal of Mathematical Sciences
- Vol. 232 (5) , 635-646
On Derived Equivalence of Algebras of Semidihedral Type with Two Simple Modules
- Open Access
- 23 May 2018
- Published by Springer Nature in Journal of Cheminformatics
- Vol. 10 (1) , 1-10
Putting hands to rest: efficient deep CNN-RNN architecture for chemical named entity recognition with no hand-crafted rules
Chemical named entity recognition (NER) is an active field of research in biomedical natural language processing. To facilitate the development of new and superior chemical NER systems, BioCreative released the CHEMDNER corpus, an extensive dataset of diverse manually annotated chemical entities. Most of the systems trained on the corpus rely on complicated hand-crafted rules or curated databases for data preprocessing, feature extraction and output post-processing, though modern machine learning algorithms, such as deep neural networks, can automatically design the rules with little to none human intervention. Here we explored this approach by experimenting with various deep learning architectures for targeted tokenisation and named entity recognition. Our final model, based on a combination of convolutional and stateful recurrent neural networks with attention-like loops and hybrid word- and character-level embeddings, reaches near human-level performance on the testing dataset with no manually asserted rules. To make our model easily accessible for standalone use and integration in third-party software, we’ve developed a Python package with a minimalistic user interface.
- 23 May 2018
- Published by Springer Nature in Journal of Cheminformatics
- Vol. 10 (1) , 1-10
Open AccessPutting hands to rest: efficient deep CNN-RNN architecture for chemical named entity recognition with no hand-crafted rules
Chemical named entity recognition (NER) is an active field of research in biomedical natural language processing. To facilitate the development of new and superior chemical NER systems, BioCreative released the CHEMDNER corpus, an extensive dataset of diverse manually annotated chemical entities. Most of the systems trained on the corpus rely on complicated hand-crafted rules or curated databases for data preprocessing, feature extraction and output post-processing, though modern machine learning algorithms, such as deep neural networks, can automatically design the rules with little to none human intervention. Here we explored this approach by experimenting with various deep learning architectures for targeted tokenisation and named entity recognition. Our final model, based on a combination of convolutional and stateful recurrent neural networks with attention-like loops and hybrid word- and character-level embeddings, reaches near human-level performance on the testing dataset with no manually asserted rules. To make our model easily accessible for standalone use and integration in third-party software, we’ve developed a Python package with a minimalistic user interface.