The week's pick
Reseach Article
Simplification of Boolean Algebra through DNA Computing
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 1 - Number 17 |
| Year of Publication: 2010 |
| Authors: Sanchita Paul, Gadadhar Sahoo |
10.5120/365-552
|
Sanchita Paul, Gadadhar Sahoo . Simplification of Boolean Algebra through DNA Computing. International Journal of Computer Applications. 1, 17 ( February 2010), 31-37. DOI=10.5120/365-552
Abstract
DNA Computing utilizes the properties of DNA for performing the computations. The computations include arithmetic and logical operations such as simplification of Boolean expression to its simplest form. Boolean function can be built from ANDs, ORs, and NOTs using minterm expansion. However, a practicing computer engineer will very rarely be satisfied with a minterm expansion, because as a rule, it requires more gates than necessary. The laws and identities of Boolean algebra will almost always allow us to simplify a minterm expansion. The efficiency of a logic circuit is high when the number of logic gates used to build it is small. However, minterm expression may be often simplified to a simpler Boolean expression, which can be implemented with fewer logic gates.
References
- Fukagaw. H., Fujiwara. A., Procedures for multiplication and division in DNA computing, 2004.
- Adleman L. M., Computing with DNA. Scientific American, 279(2):54–61, 1998.
- Gupta. V., Parthasarathy. S., and Zaki. M. J., Arithmetic and logic operations with DNA. In Proceedings 3rd DIMACS Workshop on DNA Based Computers, pages 212–220, 1997.
- Hug. H., and Schuler. R., DNA-based parallel computation of simple arithmetic. In Proceedings of International Meeting on DNA Based Computers, pages 159–166, 2001.
- Liption. R. J., DNA solution of hard computational problems. Science, 268:542–545, 1995.
- Qiu. Z. F., and Lu. M., Arithmetic and logic operations for DNA computers. In Proceedings of the Second IASTED International conference on Parallel and Distributed Computing and Networks, pages 481–486, 1998.
- Qiu. Z. F., and Lu. M., Take advantage of the computing power of DNA computers. In Proceedings of the Third Workshop on Bio-Inspired Solutions to Parallel Processing Problems, IPDPS 2000 Workshops, pages 570–577, 2000.
- Reif. J. H., Parallel bimolecular computation: Models and simulations. Algorithmica, 25(2/3): 142–175, 1999.
- Merrifield. R. B., Solid phase peptide synthesis. I. The synthesis of a tetra peptide. Journal of the American Chemical Society, 85:2149–2154, 1963.
- Frisco. P., Parallel arithmetic with splicing. Romanian Journal of Information Science and Technology, 2(3):113–128, 2000.
- Fujiwara. A., Matsumoto. K., and Chen. W., Addressable Procedures for logic and arithmetic operations with DNA molecules. International Journal of Foundations of Computer Science, 15(3):461–474, 2004.
- Guarnieri, F., Fliss. M., and Bancroft. C., Making DNA add. Science, 273:220–223, 1996.
- P?aun. G., Rozeberg. G., and Salomaa. A., DNA computing. Springer-Verlag, 1998.
- Kamio. S., Takehara A., and Fujiwara. A., Procedures for computing the maximum with dna strands. In Proceedings of the 2003 International Conference on Parallel and Distributed Processing Techniques and Applications, volume 1, pages 351–357, 2003.
Index Terms
Keywords