東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Simulating genetic variant data for ...

University of Southern California., Biostatistics.

FindBook

Google Book

Amazon

博客來

Simulating genetic variant data for structured populations using an approximate coalescent algorithm.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Simulating genetic variant data for structured populations using an approximate coalescent algorithm./
作者:	Jung, Hsuan.
面頁冊數:	50 p.
附註:	Adviser: Paul Marjoram.
Contained By:	Masters Abstracts International45-05.
標題:	Biology, Genetics. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1443897

Simulating genetic variant data for structured populations using an approximate coalescent algorithm.
Jung, Hsuan.

Simulating genetic variant data for structured populations using an approximate coalescent algorithm. - 50 p.

Adviser: Paul Marjoram.

Thesis (M.S.)--University of Southern California, 2007.

In this thesis we develop a program for simulating genetic variants data over long chromosomal region for structured populations. We also implement a simplified version of the algorithm for gene conversion. We show that when recombination, but not gene conversion, is present, the program generates data that is a very close approximation to that generated by the full coalescent model (in terms of LD), given that the migration rate is not too low. The implementation of gene conversion, however, does not yield the same desirable result. However, the program takes less than 2 hours to generate whole chromosomal data, which is impossible given conventional techniques.Subjects--Topical Terms:

1017730
Biology, Genetics.

Simulating genetic variant data for structured populations using an approximate coalescent algorithm.
LDR:01506nam 2200253 a 45 001 852123
005 20100629
008 100629s2007 ||||||||||||||||| ||eng d
035 $a (UMI)AAI1443897
035 $a AAI1443897
040 $a UMI $c UMI
100 1 $a Jung, Hsuan. $3 1017863
245 1 0 $a Simulating genetic variant data for structured populations using an approximate coalescent algorithm.
300 $a 50 p.
500 $a Adviser: Paul Marjoram.
500 $a Source: Masters Abstracts International, Volume: 45-05, page: 2356.
502 $a Thesis (M.S.)--University of Southern California, 2007.
520 $a In this thesis we develop a program for simulating genetic variants data over long chromosomal region for structured populations. We also implement a simplified version of the algorithm for gene conversion. We show that when recombination, but not gene conversion, is present, the program generates data that is a very close approximation to that generated by the full coalescent model (in terms of LD), given that the migration rate is not too low. The implementation of gene conversion, however, does not yield the same desirable result. However, the program takes less than 2 hours to generate whole chromosomal data, which is impossible given conventional techniques.
590 $a School code: 0208.
650 4 $a Biology, Genetics. $3 1017730
690 $a 0369
710 2 $a University of Southern California. $b Biostatistics. $3 1017862
773 0 $t Masters Abstracts International $g 45-05.
790 $a 0208
790 1 0 $a Marjoram, Paul, $e advisor
791 $a M.S.
792 $a 2007
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1443897