DNA-algorithm for timetable problem.
| Autor: | Popov IY; St. Petersburg National Research University of Information Technologies, Mechanics and Optics, 49 Kronverkskiy, St. Petersburg, 197101, Russia., Vorobyova AV; St. Petersburg National Research University of Information Technologies, Mechanics and Optics, 49 Kronverkskiy, St. Petersburg, 197101, Russia., Blinova IV; St. Petersburg National Research University of Information Technologies, Mechanics and Optics, 49 Kronverkskiy, St. Petersburg, 197101, Russia. |
|---|---|
| Jazyk: | angličtina |
| Zdroj: | International journal of bioinformatics research and applications [Int J Bioinform Res Appl] 2014; Vol. 10 (2), pp. 145-56. |
| DOI: | 10.1504/IJBRA.2014.059520 |
| Abstrakt: | Using of DNA molecules for solving of NP-complete problems is discussed. Properties of DNA allow one to reduce the number of operations from exponential to polynomial. DNA-algorithm for solving of the timetable problem is suggested. The starting point is a set of classes, teachers and hours with some limitations. It is necessary to determine whether there is a timetable satisfying all limitations. The sets of classes, teachers and hours are coded by chains of nucleotides. After preparing of the input multi-set containing all possible timetables the filtering procedure should be made. It allows to exclude all illegal timetables. The filtering algorithm is suggested. An example is described. The analysis of the algorithm is made. |
| Databáze: | MEDLINE |
| Externí odkaz: |
|