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.
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.
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.
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
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.
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.