Breadcrumb

 
 

Generic C++ implementations of pairwise sequence alignment : instantiation for local alignment

Title:

Generic C++ implementations of pairwise sequence alignment : instantiation for local alignment

Yang, Xiao (2003) Generic C++ implementations of pairwise sequence alignment : instantiation for local alignment. Other thesis, Concordia University.

[img]
Preview
PDF - Accepted Version
2258Kb

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 > Faculty of Engineering and Computer Science > Computer Science and Software Engineering
Item Type:Thesis (Other)
Authors:Yang, Xiao
Pagination:vii, 60 leaves : ill. ; 29 cm.
Institution:Concordia University
Degree Name:Major reports (M.Comp.Sc.)
Program:Dept. of Computer Science
Date:2003
Thesis Supervisor(s):Butler, Greg
ID Code:2412
Deposited By:Concordia University Libraries
Deposited On:27 Aug 2009 13:28
Last Modified:14 Dec 2012 16:37
Related URLs:
All items in Spectrum are protected by copyright, with all rights reserved. The use of items is governed by Spectrum's terms of access.

Repository Staff Only: item control page

Document Downloads

More statistics for this item...

Concordia University - Footer