Haplotype inference by pure-parsimony using revamped delayed haplotype selection. (c2011)

LAUR Repository

Show simple item record

dc.contributor.author Abdallah, Raymond
dc.date.accessioned 2011-11-04T09:15:04Z
dc.date.available 2011-11-04T09:15:04Z
dc.date.copyright 2011 en_US
dc.date.issued 2011-11-04
dc.date.submitted 2011-05-30
dc.identifier.uri http://hdl.handle.net/10725/966
dc.description Includes bibliographical references (leave 34). en_US
dc.description.abstract In recent years, there has been a worldwide initiative to gather as much information as possible about the human genome, resulting in the Human Genome Project (HGP). The HGP project was founded on the basis of gathering genetic information to be used in various bioinformatics areas. The Human Genome Project’s main purpose is to find the common ancestry among various peoples around the globe in order to identify origins and gene-related diseases. Haplotype Inference(HI) is one of the problems tackled in the HGP, whereby from a given population of genotypes the goal is to find the minimum number of haplotypes from which the genotypes could have derived. Clark’s Algorithm is the first known algorithm to deal with this problem from a Computer Scientist’s perspective. It has been the basis for many other algorithms afterwards. One such algorithm is the Delayed Haplotype Selection(DS). Our work is an improvement of the DS. We call the resulting algorithm Revamped Haplotype Selection(RDS) algorithm. We test our algorithm on real and simulated data, and compare it to the DS algorithm and a Branch-and-Bound approach (known as HAPAR). Results prove that our algorithm significantly outperforms both in the quality of the solution as well as in running time. en_US
dc.language.iso en en_US
dc.subject Branch and bound algorithms en_US
dc.subject Molecular genetics -- Mathematics en_US
dc.subject Genetics -- Statistical methods en_US
dc.title Haplotype inference by pure-parsimony using revamped delayed haplotype selection. (c2011) en_US
dc.type Thesis en_US
dc.term.submitted Spring en_US
dc.author.degree MS in Computer Science en_US
dc.author.school Arts and Sciences en_US
dc.author.idnumber 200401454 en_US
dc.author.commembers Dr. Haidar Harmanani
dc.author.commembers Dr. Jean Takchi
dc.author.woa OA en_US
dc.description.physdesc 1 bound copy: vii, 34 leaves; ill.; 30 cm. available at RNL. en_US
dc.author.division Computer Science en_US
dc.author.advisor Dr. Danielle Azar
dc.keywords Haplotype en_US
dc.keywords Branch and Bound en_US
dc.keywords Delayed Haplotype Selection en_US
dc.keywords Pure Parsimony en_US
dc.keywords Haplotype Inference en_US
dc.identifier.doi https://doi.org/10.26756/th.2011.19 en_US
dc.publisher.institution Lebanese American University en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search LAUR

Advanced Search


My Account