On the computational power of DNA
Discrete Applied Mathematics - Special volume on computational molecular biology
Using DNA to solve the bounded Post correspondence problem
Theoretical Computer Science - Special issue on universal machines and computations
Handbook of Formal Languages
Molecular Computing, Bounded Nondeterminism, and Efficient Recursion
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
DNA models and algorithms for NP-complete problems
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
Towards a DNA Solution to the Shortest Common Superstring Problem
INTSYS '98 Proceedings of the IEEE International Joint Symposia on Intelligence and Systems
Simulating Boolean Circuits on a DNA Computer
Simulating Boolean Circuits on a DNA Computer
Theoretical and Experimental DNA Computation (Natural Computing Series)
Theoretical and Experimental DNA Computation (Natural Computing Series)
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
| Hi-index | 0.00 |
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.