DNA databases

BioSystems

Volumn 81, Issue 3, 2005, Pages 234-246

  Schuster, Alfons ^a  

^a UNIVERSITY OF ULSTER   (United Kingdom)

Author keywords

Algorithm; Database; DNA

Indexed keywords

DNA;

DNA;

ALGORITHM; ARTICLE; DATA BASE; DNA STRAND; MATHEMATICAL COMPUTING; MATHEMATICAL MODEL; MATHEMATICS;

EID: 23644439735     PISSN: 03032647     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.biosystems.2005.04.004     Document Type: Article

References (9)

1. L.M. Adleman Molecular computation of solutions to combinatorial problems Science 266 1994 1021 1024
2. W.L. Chang, and M. Guo Solving the set-cover problem and the problem of exact cover by 3-sets in the Adleman-Lipton model BioSystems 72 3 2003 263 275
3. W.L. Chang, M. Ho, and M. Guo Molecular solutions for the subset-sum problem on DNA-based supercomputing BioSystems 73 2 2004 117 130
4. T. Connolly, and C. Begg Database Systems - A Practical Approach to Design, Implementation, and Management 2002 Addison Wesley
5. J.L. Lipton DNA solution to hard computational problems Science 268 1995 542 545
6. G. Paun, G. Rozenberg, and A. Salomaa DNA Computing - New Computing Paradigms 1998 Springer-Verlag Berlin
7. Z. Pawlak, J. Grzymala-Busse, R. Slowinski, and W. Ziarco Rough sets Communications of the ACM 38 11 1995 89 95
8. Schuster A., 2003. DNA algorithms for rough set analysis. In: Proceedings of the Fourth International Conference on Intelligent Data Engineering, Automated Learning IDEAL'03, Hong Kong, China. Liu, J., Cheung, Y., Yin, H. (Eds.), Lecture Notes in Computer Science, vol. 2690, Springer-Verlag, Berlin, pp. 498- 513.
9. R.R. Sinden DNA Structure and Function 1994 Academic Press