DNA computing algorithm for recyclable waste paper sorting.

This article explores the applicability of DNA Computing in recyclable waste paper sorting. The primary challenge in the recycling of paper is to obtain raw material with the highest purity. In recycling, waste papers are segregated into various grades as they are subjected to different recycling processes. Highly sorted paper streams w ill facilitate high quality end product, and save processing chemicals and energy. Due to inadequate throughput and some major drawbacks of mechanical paper sorting systems, the popularity of optical paper sorting systems has increased. Automated paper sorting systems offer significant advantages over manual paper sorting systems in terms of fatigue, throughput, speed, and accuracy. In this research, a new DNA computing algorithm has been designed. It is based on the template matching technique for segregating recyclable waste paper according to its grades. Using the concepts of replication and massive parallelism operations, the DNA computing algorithm can efficiently reduce the computational time of the template matching method for real time inspection. The algorithm is implemented using silicon-based computer to verify the success rate in paper grade identification. [ABSTRACT FROM AUTHOR]