A Parallel Implementation of Needleman-Wunsch Algorithm for Biological Sequence Comparison

Kini, Gopalakrishna N and Shivam, Kumar and Sinha, Shreya (2017) A Parallel Implementation of Needleman-Wunsch Algorithm for Biological Sequence Comparison. In: Indian Symposium on Computer Systems Research, 25/05/2017, Indian institute of technology, bombay.

[img] PDF
747.pdf - Published Version
Restricted to Registered users only

Download (439kB) | Request a copy


This paper discusses the issues involved in implementing Needleman-Wunsch algorithm for biological sequence comparison on a general-purpose parallel computing platform. Parallelism is exploited at fine-grain level multithreading. An attempt is made in this algorithm to suggest low latency overhead with reduced computational time. We are implementing this algorithm in support of parallel programming languages such as using OpenCL and CUDA. The same biological sequence comparison has been done by taking in to account of sequential program as well as Message Passing Interface (MPI). Our experimental results show that how quick we can analyze the biological sequence using parallel languages

Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: Sequence alignment; Similarity matrix; Gap penalty
Subjects: Engineering > MIT Manipal > Computer Science and Engineering
Depositing User: MIT Library
Date Deposited: 23 Jun 2017 10:19
Last Modified: 09 Aug 2017 03:44
URI: http://eprints.manipal.edu/id/eprint/149147

Actions (login required)

View Item View Item