東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Combinatorial Algorithms for Haploty...

Mazrouee, Sepideh.

Linked to FindBook

Google Book

Amazon

博客來

Combinatorial Algorithms for Haplotype Assembly.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Combinatorial Algorithms for Haplotype Assembly./
Author:	Mazrouee, Sepideh.
Published:	Ann Arbor : ProQuest Dissertations & Theses, : 2017,
Description:	170 p.
Notes:	Source: Dissertation Abstracts International, Volume: 79-04(E), Section: B.
Contained By:	Dissertation Abstracts International79-04B(E).
Subject:	Conservation biology. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10637396
ISBN:	9780355396348

Combinatorial Algorithms for Haplotype Assembly.
Mazrouee, Sepideh.

Combinatorial Algorithms for Haplotype Assembly. - Ann Arbor : ProQuest Dissertations & Theses, 2017 - 170 p.

Source: Dissertation Abstracts International, Volume: 79-04(E), Section: B.

Thesis (Ph.D.)--University of California, Los Angeles, 2017.

Many phenotypes such as genetic disorders may be hereditary while others may be influenced by the environment. However, some genetic disorders are due to new mutations in the individuals DeoxyriboNucleic Acid (DNA). Diseases such as diabetes and specific types of cancer are examples of the conditions that can be inherited or affected by lifestyle genetic mutations. In order to investigate and predict the incidence of such diseases, sequences of single individuals need to be examined. In the past decade, the Next Generation Sequencing (NGS) technology has enabled us to generate DNA sequences of many organisms. Yet, reconstructing each copy of chromosome remains an open research problem due to computational challenges associated with processing a massive amount of DNA data and understanding complex structure of such data for individual DNA phasing.

ISBN: 9780355396348Subjects--Topical Terms:

535736
Conservation biology.

Combinatorial Algorithms for Haplotype Assembly.
LDR:02744nmm a2200325 4500 001 2156485
005 20180517112612.5
008 190424s2017 ||||||||||||||||| ||eng d
020 $a 9780355396348
035 $a (MiAaPQ)AAI10637396
035 $a (MiAaPQ)ucla:16225
035 $a AAI10637396
040 $a MiAaPQ $c MiAaPQ
100 1 $a Mazrouee, Sepideh. $3 3344245
245 1 0 $a Combinatorial Algorithms for Haplotype Assembly.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2017
300 $a 170 p.
500 $a Source: Dissertation Abstracts International, Volume: 79-04(E), Section: B.
500 $a Adviser: Wei -. Wang.
502 $a Thesis (Ph.D.)--University of California, Los Angeles, 2017.
520 $a Many phenotypes such as genetic disorders may be hereditary while others may be influenced by the environment. However, some genetic disorders are due to new mutations in the individuals DeoxyriboNucleic Acid (DNA). Diseases such as diabetes and specific types of cancer are examples of the conditions that can be inherited or affected by lifestyle genetic mutations. In order to investigate and predict the incidence of such diseases, sequences of single individuals need to be examined. In the past decade, the Next Generation Sequencing (NGS) technology has enabled us to generate DNA sequences of many organisms. Yet, reconstructing each copy of chromosome remains an open research problem due to computational challenges associated with processing a massive amount of DNA data and understanding complex structure of such data for individual DNA phasing.
520 $a In this dissertation, I introduce several computational frameworks for understanding the complex structure of DNA sequence data to reconstruct chromosome copies in diploid and polyploid organisms. The methodologies that are presented in this dissertation span several areas of research including unsupervised learning, combinatorial optimization, graph partitioning, and association rule learning. The overarching theme of this research is design and validation of novel combinatorial algorithms for fast and accurate haplotype assembly. The first two frameworks presented in this dissertation, called FastHap and ARHap, are tailored toward providing computationally simple diploid haplotypes with the objective of minimizing minimum error correction and switching error, respectively. I then introduce HapColor and PolyCluster, which aim to improve minimum error correction and switching error in polyploid haplotyping.
590 $a School code: 0031.
650 4 $a Conservation biology. $3 535736
650 4 $a Bioinformatics. $3 553671
650 4 $a Computer science. $3 523869
690 $a 0408
690 $a 0715
690 $a 0984
710 2 $a University of California, Los Angeles. $b Computer Science. $3 2104007
773 0 $t Dissertation Abstracts International $g 79-04B(E).
790 $a 0031
791 $a Ph.D.
792 $a 2017
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10637396