English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 43236/136794
造访人次 : 2059691      在线人数 : 141
RC Version 3.1 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 进阶搜寻

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ntur.lib.ntu.edu.tw/handle/246246/164670

题名: On the Tail Probability of the Longest Well-Matching Run
作者: 張啟仁
CHANG, CHEE-JEN
贡献者: 臨床醫學研究所
关键词: run test;Markov chain embedding;k-interrupted run
日期: 2003
上传时间: 2009-09-09T06:41:56Z
摘要: The distribution of the length of the longest run has wide applications in regard to reliability and DNA sequencing. Statistical tests based on the longest well-matching run are usually considered to be more reasonable than tests based on the perfect-matching run. In this paper, a method adopted from Fu and Koutras (J. Amer. Statist. Assoc. 89 (1994) 1050) is proposed to improve the efficiency of computing the exact distribution of length. We used the result to investigate the accuracy of some approximations of the distribution. (C) 2003 Elsevier Science B.V. All rights reserved.
關聯: STATISTICS & PROBABILITY LETTERS v.63 n.3 pp.267-274
显示于类别:[臨床醫學研究所] 期刊論文

文件中的档案:

没有与此文件相关的档案.



在NTUR中所有的数据项都受到原著作权保护.

 

DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team  - 回馈