Automatic Parallelization for Parallel Architectures Using Smith Waterman Algorithm
نویسندگان
چکیده
Gene sequencing problems are one of the predominant issues for researchers to come up with an optimized system model that could facilitate the optimum processing and efficiency without introducing overheads in terms of memory and time. This research is oriented towards developing such kind of system while taking into consideration of the dynamic programming approach called a Smith Waterman algorithm in its enhanced form decorated with other supporting and optimized techniques. This paper provides an introduction oriented knowledge transfer so as to provide a brief introduction of research domains, research gap and motivations, objective formulated and proposed systems to accomplish ultimate objectives. KeywordsSmith-Waterman (SW), Multiple-Instruction, Multiple-Data (MIMD), Single Instruction, Multiple Data (SIMD), Smith-Waterman algorithm (SW), Diagonal Parallel Sequencing and Alignment Approach (DPSAA),
منابع مشابه
Staircase Method: A Novel Method for Parallelizing S-W Algorithm
Sequence comparison is a basic operation in DNA sequencing projects, and most of sequence comparison methods are based on heuristics, which are fast but not sensitive. The Dynamic Programming Algorithm, Smith-Waterman, obtains the best alignment, but at the expense of computational time. Unfortunately, the inefficiency in the performance of the Smith-Waterman algorithm limits its applications i...
متن کاملA Theoretical Study of Extreme Parallelism in Sequence Alignments
In this paper, we describe fully parallelized architectures for one-to-one, one-to-many, and many-to-many sequence alignments using Smith-Waterman algorithm. The architectures utilize the principles of parallelism and pipelining to the greatest extent in order to take advantage of both intrasequence and inter-sequence parallelization and to achieve high speed and throughput. First, we describe ...
متن کاملParallelization of Biological Gene Sequencing Technique with Optimized Smith Waterman Algorithm
The presented research work represent a highly robust and efficient parallel computing system development for biological gene sequencing. In this research work, the existing approaches has optimized the most optimum approach available till date in the form of Smithy Waterman algorithm for gene alignment or local gene sequencing. This paper mainly emphasizes on the system development for a trace...
متن کاملFirst Experiences Optimizing Smith-Waterman on Intel's Knights Landing Processor
The well-known Smith-Waterman (SW) algorithm is the most commonly used method for local sequence alignments. However, SW is very computationally demanding for large protein databases. There exist several implementations that take advantage of computing parallelization on many-cores, FPGAs or GPUs, in order to increase the alignment throughtput. In this paper, we have explored SW acceleration on...
متن کاملParallel Smith-Waterman Algorithm for Gene Sequencing
Smith-Waterman Algorithm represents a highly robust and efficient parallel computing system development for biological gene sequence. The research work here gives a deep understanding and knowledge transfer about exiting approach for gene sequencing and alignment using Smith-waterman their strength and weaknesses. Smith-Waterman algorithm calculates the local alignment of two given sequences us...
متن کامل