Efficient haplotyping for families
Name
635472064-MIT.pdf
Description
Full printable version
Size
6.71 MB
Format
Adobe PDF
Checksum (MD5)
3f3276bfe23da8c8e52413c17b4e2cde
Author(s)
Williams, Amy Lynne, Ph.D. Massachusetts Institute of Technology
Advisor(s)
David K. Gifford.
Date Issued
2010
Publisher
Massachusetts Institute of Technology
Abstract
Hapi is a novel dynamic programming algorithm for haplotyping nuclear families that outperforms contemporary family-based haplotyping algorithms. Haplotypes are useful for mapping and identifying genes which cause and contribute to the etiology of human disease, and for analyzing the products of meiosis to locate recombinations, enabling the identification of recombination hotspots and gene conversions. They can also be used to study population history, including expansion, contraction, and migration patterns in humans and other species. Hapi's efficiency is a result of eliminating or ignoring states and state transitions that are unnecessary for computing haplotypes. When applied to a dataset containing 103 families, Hapi performs over 3.8-320 times faster than state-of-the-art algorithms. These efficiency gains are practically important as they enable Hapi to haplotype family datasets which current algorithms are either unable to handle or are impractical for because of time constraints. Hapi infers both minimum-recombinant and maximum likelihood haplotypes, and because it applies to related individuals, the haplotypes it infers are highly accurate over large genomic distances.
Description
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2010.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 81-83).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
M.I.T. theses are protected by
copyright. They may be viewed from this source for any purpose, but
reproduction or distribution in any format is prohibited without written
permission. See provided URL for inquiries about permission.
copyright. They may be viewed from this source for any purpose, but
reproduction or distribution in any format is prohibited without written
permission. See provided URL for inquiries about permission.
Persistent DSpace Link
