Error-tolerant minimum finding with DNA computing

International Journal of Innovative Computing, Information and Control

Volumn 5, Issue 10, 2009, Pages 3045-3057

  Yang, Chia Ning ^a   Huang, Kuo Si ^b   Yang, Chang Biau ^c   Hsu, Chie Yao ^c  

^a NATIONAL UNIVERSITY OF KAOHSIUNG   (Taiwan)

^b SHU ZEN COLLEGE OF MEDICINE AND MANAGEMENT   (Taiwan)

^c NATIONAL SUN YAT SEN UNIVERSITY   (Taiwan)

Author keywords

Chemistry experiment error; DNA computing; Minimum finding; Molecular computing

Indexed keywords

BROADCAST COMMUNICATION MODELS; BROADCASTING SCHEMES; CHEMISTRY EXPERIMENT ERROR; COMPUTATIONAL PROBLEM; DESIGNED EXPERIMENTS; DNA COMPUTING; ERROR TOLERANT; HAMILTONIAN PATH PROBLEMS; MASSIVE DATA; MINIMUM FINDING; MOLECULAR COMPUTING; NOVEL STRATEGIES; SAT PROBLEMS;

CALCULATIONS; COMPUTER SIMULATION; DATA PROCESSING; DNA; ERRORS; EXPERIMENTS; GENES; GENETIC PROGRAMMING; INFORMATION THEORY; NUCLEIC ACIDS;

COMPUTER SCIENCE;

EID: 70350506610     PISSN: 13494198     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (25)

1. R. B. Abu Bakar, J. Watada, and W. Pedrycz, A proximity approach to DNA based clustering analysis, International Journal of Innovative Computing, Information and Control, vol. 4, no. 5, pp. 1203-1212, 2008.
2. L. M. Adleman, Molecular computation of solutions to combinatorial problems, Science, vol. 266, no. 5187, pp. 1021-1024, 1994.
3. S. G. Akl, The Design and Analysis of Parallel Algorithms. Prentice-Hall, Englewood Cliffs, New Jersey, USA, first ed., 1989.
4. T. Akutsu, S. Kuhara, O. Maruyama, and S. Miyano, Identification of genetic networks by strategic gene disruptions and gene overexpressions under a boolean model, Theoretical Computer Science, vol. 298, no. 1, pp. 235-251, 2003.
5. J. I. Capetanakis, Tree algorithms for packet broadcast channels, IEEE Transactions on Information Theory, vol. 25, no. 5, pp. 505-515, 1979.
6. C.-C. Chang, T.-C. Lu, Y.-F. Chang, and C.-T. Lee, Reversible data hiding schemes for deoxyribonucleic acid (DNA) medium, International Journal of Innovative Computing, Information and Control, vol. 3, no. 5, pp. 1145-1160, 2007.
7. R. Dechter and L. Kleinrock, Broadcast communications and distributed algorithms, IEEE Transactions on Computers, vol. 35, no. 3, pp. 210-219, 1986.
8. A. Dove, From bits to bases: Computing with DNA, Nature Biotechnology, vol. 16, no. 9, pp. 830-832, 1998.
9. S. P. A. Fodor, Massively parallel genomics, Science, vol. 277, no. 5324, pp. 393-395, 1997.
10. R. H. Garrett and C. M. Grisham, Biochemistry, Fort Worth: Saunders College Pub., Second ed., 1998.
11. G. Gloor, L. Kari, M. Gaasenbeek, and S. Yu, Towards a DNA solution to the shortest common superstring problem, International Journal on Artificial Intelligence Tools, vol. 8, no. 4, pp. 385-400, 1999.
12. M. Hagiya, Prom molecular computing to molecular programming, Proc. of the 6th International Workshop on DNA-Based Computers, LNCS, vol. 2054, pp. 89-102, 2001.
13. T. Hinze and M. Sturm, A universal lunctional approach to DNA computing and its experimental practicability, Proc. of the 6th DIM ACS Workshop on DNA Based Computers, The University of Leiden, Leiden, The Netherlands, pp. 257-266, 2000.
14. I. Kim, D. J.-F. Jeng, and J. Watada, Redesigning subgroups in a personnel network based on DNA computing, International Journal of Innovative Computing, Information and Control, vol. 2, no. 4, pp. 885-896, 2006.
15. S. P. Levitan and C. C. Foster, Finding an extremum in a network, Proc. of the 9th Annual Symposium on Computer Architecture, Austin, Texas, United States, pp. 321-325, 1982.
16. C. H. Lin, H. P. Cheng, C. N. Yang, and C. B. Yang, Solving satisfiability problems using a novel microarray-based DNA computer, BioSystems, vol. 90, no. 1, pp. 242-252, 2007.
17. R. J. Lipton, DNA solution of hard computational problems, Science, vol. 268, no. 5210, pp. 542-545, 1995.
18. D. L. Robertson and F. G. Joyce, Selection in vitro of an RNA enzyme that specifically cleaves single-stranded DNA, Nature, vol. 344, no. 6265, pp. 467-468, 1990.
19. S. H. Shiau and C. B. Yang, A fast maximum finding algorithm on broadcast communication, Information Processing Letters, vol. 60, pp. 81-89, 1996.
20. S. H. Shiau and C. B. Yang, A fast initialization algorithm for single-hop wireless networks, IEICE Transactions on Communications, vol. E88-B, no. 11, pp. 4285-4292, 2005.
21. W. P. C. Stemmer, Rapid evolution of a protein by DNA shuffling, Nature, vol. 370, no. 6488, pp. 389391, 1994.
22. K. Tanaka, A. Okamoto, and I. Saito, Public-key system using DNA as a one-way function for key distribution, Biosystems, vol. 81, no. 1, pp. 25-29, 2005.
23. H. Y. Wang, C. B. Yang, K. S. Huang, and Y. L. Shiue, The design of sorters based on DNA for bio-computers, Proc. of the International Computer Symposium, Workshop on Algorithms and Computational Molecular Biology, Hualien, Taiwan, 2002.
24. C. B. Yang, R. C. T. Lee, and W. T. Chen, Parallel graph algorithms based upon broadcast communications, IEEE Transactions on Computers, vol. 39, no. 12, pp. 1468-1472, 1990.
25. C. N. Yang and C. B. Yang, A DNA solution of SAT problem by a modified sticker model, BioSystems, vol. 81, no. 1, pp. 1-9, 2005.