Show simple item record

dc.contributor.advisorMoshkov, Mikhail
dc.contributor.authorOdat, Enas M.
dc.date.accessioned2013-03-11T06:11:35Z
dc.date.available2013-03-11T06:11:35Z
dc.date.issued2011-05
dc.identifier.doi10.25781/KAUST-42E8N
dc.identifier.urihttp://hdl.handle.net/10754/271672
dc.description.abstractThe purpose of this dissertation is to present a methodology to model global sequence alignment problem as directed acyclic graph which helps to extract all possible optimal alignments. Moreover, a mechanism to sequentially optimize sequence alignment problem relative to different cost functions is suggested. Sequence alignment is mostly important in computational biology. It is used to find evolutionary relationships between biological sequences. There are many algo- rithms that have been developed to solve this problem. The most famous algorithms are Needleman-Wunsch and Smith-Waterman that are based on dynamic program- ming. In dynamic programming, problem is divided into a set of overlapping sub- problems and then the solution of each subproblem is found. Finally, the solutions to these subproblems are combined into a final solution. In this thesis it has been proved that for two sequences of length m and n over a fixed alphabet, the suggested optimization procedure requires O(mn) arithmetic operations per cost function on a single processor machine. The algorithm has been simulated using C#.Net programming language and a number of experiments have been done to verify the proved statements. The results of these experiments show that the number of optimal alignments is reduced after each step of optimization. Furthermore, it has been verified that as the sequence length increased linearly then the number of optimal alignments increased exponentially which also depends on the cost function that is used. Finally, the number of executed operations increases polynomially as the sequence length increase linearly.
dc.language.isoen
dc.titleSequential Optimization of Global Sequence Alignments Relative to Different Cost Functions
dc.typeThesis
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
thesis.degree.grantorKing Abdullah University of Science and Technology
dc.contributor.committeememberRavasi, Timothy
dc.contributor.committeememberShihada, Basem
thesis.degree.disciplineComputer Science
thesis.degree.nameMaster of Science
refterms.dateFOA2015-01-01T00:00:00Z


Files in this item

Thumbnail
Name:
Thesis (2).pdf
Size:
1.338Mb
Format:
PDF
Description:
Thesis

This item appears in the following Collection(s)

Show simple item record