Yang, Xiao (2003) Generic C++ implementations of pairwise sequence alignment : instantiation for local alignment. [Graduate Projects (Non-thesis)] (Unpublished)
Preview |
Text (application/pdf)
2MBMQ91147.pdf - Accepted Version |
Abstract
Although there are already several C implementations of pairwise sequence alignment in the EMBOSS library for bioinformatics, all of them are quite independent of each other. The main purpose of this project is to develop a generic application to unify the different implementations and to provide the developer with the capability to develop a pairwise alignment algorithm with little effort. C++ template technology provides high levels of performance and reusability project to achieve generic algorithm. An alignment algorithm is defined as a function object, which will be passed as a parameter to a generic implementation of dynamic programming. In this report, the local alignment algorithm of Smith-Waterman is instantiated. This application provides two kinds of reusability: generic algorithm reusability and function objects reusability.
Divisions: | Concordia University > Gina Cody School of Engineering and Computer Science > Computer Science and Software Engineering |
---|---|
Item Type: | Graduate Projects (Non-thesis) |
Authors: | Yang, Xiao |
Pagination: | vii, 60 leaves : ill. ; 29 cm. |
Institution: | Concordia University |
Degree Name: | M. Comp. Sc. |
Program: | Computer Science |
Department (as was): | Department of Computer Science |
Date: | 2003 |
Thesis Supervisor(s): | Butler, Greg |
Identification Number: | QA 76 M26+ 2003 no.30 |
ID Code: | 2412 |
Deposited By: | Concordia University Library |
Deposited On: | 27 Aug 2009 17:28 |
Last Modified: | 20 Oct 2022 20:45 |
Related URLs: |
Repository Staff Only: item control page