Sergey D. Makhortov

Sergey D. Makhortov

Auto-generated profile, based on publicly available information

Sergey D. Makhortov

Voronezh State University

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 April 2022 in Science Advances
Verified
Journal Article
Open access
AMAlexander Y. Maslov
Alexander Y. Maslov
SMSergey Makhortov
Sergey Makhortov
SSShixiang Sun
Shixiang Sun
JHJohanna Heid
Johanna Heid
XDXiao Dong
Xiao Dong
JVJan Vijg
Jan Vijg
Postzygotic somatic mutations have been found associated with human disease, including diseases other than cancer. Most information on somatic mutations has come from studying clonally amplified mutant cells, based on a growth advantage or genetic drift. However, almost all somatic mutations are unique for each cell, and the quantitative analysis of these low-abundance mutations in normal tissues remains a major challenge in biology. Here, we introduce single-molecule mutation sequencing (SMM-seq), a novel approach for quantitative identification of point mutations in normal cells and tissues.

6 June 2016 in Nature Methods
Verified
Journal Article
Open access
PDF file
WQWilber Quispe-Tintaya
Wilber Quispe-Tintaya
TGTatyana Gorbacheva
Tatyana Gorbacheva
MLMoonsook Lee
Moonsook Lee
SMSergei Makhortov
Sergei Makhortov
Vasily N. PopovVasily N. Popov
Vasily N. Popov
AMAlexander Y. Maslov
Alexander Y. Maslov
The detection and quantification of low-abundance somatic DNA mutations by high-throughput sequencing is challenging because of the difficulty of distinguishing errors from true mutations. There are several approaches available for analyzing somatic point mutations and small insertions or deletions, but an accurate genome-wide assessment of somatic structural variants (somSVs) in bulk DNA is still not possible. Here we present Structural Variant Search (SVS), a method to accurately detect rare somSVs by low-coverage sequencing. We demonstrate direct quantitative assessment of elevated somSV frequencies induced by known clastogenic compounds in human primary cells.

29 July 2009 in Programming and Computer Software
Verified
Journal Article
Closed access
PDF file
SMS. D. Makhortov
S. D. Makhortov
Lattice-based algebraic structures containing semantics of production-logic inference on a type hierarchy in an object-oriented system with an additional relation are introduced. Specific features of these structures, such as closedness, possibility of equivalent transformations, existence of logical reduction, are studied. It is shown how to apply the model developed to verification and optimization of type hierarchies. An important direction of the optimization is automatic elimination of code duplication by “pulling up” common attributes in the type hierarchy. Implementation issues are briefly discussed.

16 November 2012 in Automation and Remote Control
Verified
Journal Article
Closed access
PDF file
SMS. D. Makhortov
S. D. Makhortov
An algebraic system containing production-logic binary relations on a complete lattice is introduced. Some properties of such relations are studied without the use of recursions. The existence of a logical closure of a noetherian binary relation is proved. This allows for defining the notion of an equivalent relation.

26 April 2019 in Journal of Physics: Conference Series
Verified
Conference Paper
Open access
PDF file
SMS D Makhortov
S D Makhortov
SBS Yu Bolotova
S Yu Bolotova
The LP structures theory contains a lattice-based algebraic approach for modeling and researching a wide range of production and similar systems in computer science. The article studies an algebraic model (LP structure) which has a number of significant capabilities that cover distributed knowledge systems. The authors formulate some results that create a theoretical basis for optimizing distributed knowledge management. The paper considers a production logical equations class, which opens up new possibilities for accelerating distributed backward logical inference.

23 July 2013 in Automation and Remote Control
Verified
Journal Article
Closed access
PDF file
SMS. D. Makhortov
S. D. Makhortov
MSM. D. Shurlin
M. D. Shurlin
This paper considers a class of lattice-based algebraic structures describing the semantics of type hierarchies in an object-oriented program system. Several properties of such structures (namely, completeness, equivalent transformations, and logical reduction) are studied. The suggested methodology serves the purpose of verification and upgrading of type hierarchies; an important direction concerns automatic elimination of code redundancy.