Date of Award
10-19-2015
Publication Type
Master Thesis
Degree Name
M.Sc.
Department
Computer Science
Supervisor
Mukhopadhyay, Asish
Rights
info:eu-repo/semantics/openAccess
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Abstract
In the recent years, due to the advancement in computational tools and techniques to analyze the biological data, biologists have been actively engaged in conducting different experiments to study the arrangements of nucleotide sequence in a chromosome. This masters thesis focuses on the area of the computational methods for the genomic map problem. Though the probe location problem under consideration is known to be NP complete, it is possible to obtain approximate solutions. The distance geometry approach for achieving efficient and better results is shown here. This also solves the point placement problem when the available distance bounds on some probe pairs, correspond to adversarial responses to distance queries between some pairs of points. DGPL program has also been implemented to construct a probe map. Finally some chosen results from the experiments and their significance have been discussed. The screenshots of the working of DGPL algorithm have been attached for better understanding.
Recommended Citation
Varaharajan Kannan, Kishore Kumar, "The point placement problem in an inexact model and its applications" (2015). Electronic Theses and Dissertations. 5434.
https://scholar.uwindsor.ca/etd/5434