DNA algorithms for rough set analysis

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2690, Issue , 2004, Pages 498-513

  Schuster, Alfons ^a  

^a UNIVERSITY OF ULSTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BIOINFORMATICS; ENGINEERING EDUCATION;

DNA ALGORITHMS; DNA-COMPUTING; ROUGH SET ANALYSIS;

ROUGH SET THEORY;

EID: 35048863917     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (5)

1. Adleman L.M.: Molecular Computation of Solutions to Combinatorial Problems. Science 266 (November 1904) 1021-1024
2. Lipton J.L.: DNA Solution to Hard Computational Problems. Science 268 (April 1995) 542-545
3. Paun G., Rozenberg G., and Salomaa A.: DNA Computing - New Computing Paradigms. Springer-Verlag, Berlin Heidelberg New York (1998)
4. Pawlak Z., Grzymala-Busse J., Slowinski R., and Ziarco W.: Rough Sets. Communications of the ACM, Vol. 38 11 (November 1995) 89-95
5. Watson J.D. and Crick F.H.C.: Molecular Structure of Nucleic Acids. Nature 171 (1953) 734-737