DECIPHERING THE SEQUENCE ALIGNMENT BY NEEDLEMAN-WUNSCH ALGORITHM ON TO REDUCE COMPUTATIONAL TIME VIA HIGH PERFORMANCE COMPUTING?Journal: International Journal of Computer Science and Mobile Computing - IJCSMC (Vol.3, No. 6)
Publication Date: 2014-06-30
Authors : Chandrasai Potladurthi; Shyam Perugu; Durga Bhavani S;
Page : 741-753
Keywords : Parallel Computing; Parallel Computing; Genes; DNA; Pairwise Alignment;
In accumulation to the old fashioned vastly parallel computers, distributed computer terminal clusters nowadays play an significant role in systematic calculating perhaps due to the introduction of article of trade high performance workstations, low latency and high-band width grids as well as potent improvement tools. In Bio-Informatics, DNA sequence information is vital to indulgent genetic variations. DNA sequencing is the progression of decisive the exact order of the chemical edifice blocks in a sample. This computation requirement is the greatest technical confront in the Human Genome Project. In this approach bioinformatics implements can speediness the exploration of huge scale sequence string data, specifically as regards sequence alignment. The Needleman Wunsch algorithm is used designed for configuration of DNA Sequences under Global Alignment grouping. A high-speed computation resolution is proposed through a parallel adaptation of this algorithm and use of the Alchemi Grid as the processing engine. In the present study we are going to pursue the Needleman Wunsch algorithm to pairwise alignment designed for configuration of large scale analysis of DNA Sequences. The main scope of this project is to parallelize the Needleman Wunsch algorithm so that it can reduce the computational time and enhance the performance using high performance computing technology.
Other Latest Articles
Last modified: 2014-06-29 21:33:49