A survey on merging DNA fragments using soft computing algorithm

DNA material is present in all living things and it contains all relative information. DNA material is very long in nature and contains more than 10,000 base pairs. These base pairs contains mainly four element i.e. adenine (A), guanine (G), cytosine(C), thymine (T). To study DNA directly is very difficult task. DNA fragmentation is the separation or breaking of DNA strands into pieces. DNA fragmentation helps in analyzing or processing on DNA fragments. After DNA fragmentation, it requires reconstruction to form original DNA to identify the living thing. Research has shown that the problems like Computational errors, Unknown origin of DNA, Repetition of similar sequence occur while reconstructing the fragments into the original one. To solve or minimize these problems many researchers have proposed different methods. In this paper, several methods are discussed as well as reviewed. Also a new method is proposed. The Proposed algorithm is based on Particle Swarm Optimization (PSO).