Your Search Results

Use this resource - and many more! - in your textbook!

AcademicPub holds over eight million pieces of educational content for you to mix-and-match your way.

Experience the freedom of customizing your course pack with AcademicPub!
Not an educator but still interested in using this content? No problem! Visit our provider's page to contact the publisher and get permission directly.

Bioinformatics: Implementation of a proposed upgraded Smith-Waterman algorithm for local alignment

By: Ruhunnabi, A.B.M.; Ahmed, I.U.; Sami, A.Z.M.; Sadi, M.S.; Das, N.;

2009 / IEEE / 978-1-4244-2756-7

Description

This item was taken from the IEEE Conference ' Bioinformatics: Implementation of a proposed upgraded Smith-Waterman algorithm for local alignment ' This paper presents a new algorithm for local alignment search which has less computational complexity than the Smith-Waterman algorithm. Increasing the accuracy of sequence matching and reducing computational complexity is a grand challenge to bioinformatics computing. The proposed Algorithm is a more competent local alignment searching Algorithm since it reduces running time well enough to search a database in order to find.