Registration Number
0220U104046,
0119U101283
, R & D reports
Title
To develop distributed methods for analyzing text information and effective procedures for recognizing complex structural objects
popup.stage_title
Head
Rаspopov Viktor B., Кандидат фізико-математичних наук
Registration Date
07-12-2020
Organization
Research and educational center of applied informatics NASU
popup.description2
The complexity of the Constraint Satisfaction Problem is investigated on the example of the consistent labeling problem. It is proved that any algorithm for its solution, which is based on the analysis of partial solutions, cannot have polynomial complexity and the time of its operation tends to increase exponentially with increasing values of the parameters of the problem. A method for constructing generating structures based on relational schemes for generating sets of structural objects is proposed. It is shown that such a procedure always leads to a valid solution for a finite number of steps.
The problem of noise immunity of text recording of genetic information in DNA and proteins is investigated. Polarity tables (based on three types of coding of information in DNA) were selected as the initial population of the genetic algorithm used in the computer experiment. The optimal variants of asymmetric codes were obtained, as well as codes with approximately the same characteristics as standard genetic code.
Improved database for cell culture collections from human and animal tissues. The list of input data characterizing the general description of cell culture is expanded. A model of the database nucleus has been created, which contains a description of genetic information about cell cultures and the conditions of their retention in the collection.
Product Description
popup.authors
Brovarnyk Vyacheslav V.
Vagis Olexandra A.
Gupal Anatoliy M
Tkachov Igor I.
popup.nrat_date
2020-12-07
