東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Change-point detection and sequence ...

Zhang, Nancy R.

FindBook

Google Book

Amazon

博客來

Change-point detection and sequence alignment: Statistical problems of genomics.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Change-point detection and sequence alignment: Statistical problems of genomics./
作者:	Zhang, Nancy R.
面頁冊數:	123 p.
附註:	Source: Dissertation Abstracts International, Volume: 66-08, Section: B, page: 4310.
Contained By:	Dissertation Abstracts International66-08B.
標題:	Statistics. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3186434
ISBN:	9780542287367

Change-point detection and sequence alignment: Statistical problems of genomics.
Zhang, Nancy R.

Change-point detection and sequence alignment: Statistical problems of genomics. - 123 p.

Source: Dissertation Abstracts International, Volume: 66-08, Section: B, page: 4310.

Thesis (Ph.D.)--Stanford University, 2005.

In Part I of this thesis, we will study the problem of estimating the number of change-points in a data series that is hypothesized to have undergone abrupt changes. We examine two different models: Gaussian data points with changing mean and Poisson process with changing rate parameter. This problem can be approached through the model selection perspective, where model complexity grows with the number of change-points. The classic Bayes Information Criterion (BIC) statistic can not be used because of irregularities in the likelihood function. By asymptotic approximation of the Bayes Factor, we derive a "modified BIC" that is theoretically justified for the change-point models that we study.

ISBN: 9780542287367Subjects--Topical Terms:

517247
Statistics.

Change-point detection and sequence alignment: Statistical problems of genomics.
LDR:02993nmm 2200301 4500 001 1827997
005 20061228142248.5
008 130610s2005 eng d
020 $a 9780542287367
035 $a (UnM)AAI3186434
035 $a AAI3186434
040 $a UnM $c UnM
100 1 $a Zhang, Nancy R. $3 1916909
245 1 0 $a Change-point detection and sequence alignment: Statistical problems of genomics.
300 $a 123 p.
500 $a Source: Dissertation Abstracts International, Volume: 66-08, Section: B, page: 4310.
500 $a Adviser: David O. Siegmund.
502 $a Thesis (Ph.D.)--Stanford University, 2005.
520 $a In Part I of this thesis, we will study the problem of estimating the number of change-points in a data series that is hypothesized to have undergone abrupt changes. We examine two different models: Gaussian data points with changing mean and Poisson process with changing rate parameter. This problem can be approached through the model selection perspective, where model complexity grows with the number of change-points. The classic Bayes Information Criterion (BIC) statistic can not be used because of irregularities in the likelihood function. By asymptotic approximation of the Bayes Factor, we derive a "modified BIC" that is theoretically justified for the change-point models that we study.
520 $a An example of application as well as a source of inspiration for the Gaussian model is the analysis of array comparative genomic hybridization (array-CGH) data. Array-CGH measures the number of chromosome copies at each genome location of a cell sample, and is useful for finding the regions of genome deletion and amplification in tumor cells. The new modified BIC statistic will be tested on array-CGH data sets and compared to existing methods. Variations to the basic change-point model that are inspired by array-CGH data will also be discussed.
520 $a In Part II, we will switch to a different problem: The characterization of scores of optimal local sequence alignments. This problem was inspired by the comparison of protein and DNA sequences in biology. The specific question that we will ask is: For which scoring functions does the optimal local alignment score grow logarithmically with sequence length? We will define the concept of "Local Optimality" and use it to prove a sufficient condition on the scoring function for logarithmic growth of the optimal score for gapped alignments. "Local Optimality" refers to the fact that in an optimal alignment, any local changes around gaps should not increase the overall score. We will use numerical studies to compare our local optimality based result to previous results and also draw some theoretical connections.
590 $a School code: 0212.
650 4 $a Statistics. $3 517247
650 4 $a Biology, Biostatistics. $3 1018416
690 $a 0463
690 $a 0308
710 2 0 $a Stanford University. $3 754827
773 0 $t Dissertation Abstracts International $g 66-08B.
790 1 0 $a Siegmund, David O., $e advisor
790 $a 0212
791 $a Ph.D.
792 $a 2005
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3186434