首页 | 本学科首页   官方微博 | 高级检索  
     检索      


On k-match problems
Institution:1. Center for Epidemiology and Healthcare Delivery Research, JPS Health Network, Fort Worth, TX;2. Oncology and Infusion Center, JPS Health Network, Fort Worth, Texas;3. Department of Internal Medicine, TCU & UNTHSC School of Medicine, Fort Worth, Texas;4. Department of Medical Education, TCU & UNTHSC School of Medicine, Fort Worth, Texas
Abstract:Several waiting time random variables for a duplication within a memory window of size k in a sequence of {1,2,…,m}-valued random variables are investigated. The exact distributions of the waiting time random variables are derived by the method of conditional probability generating functions. In particular, the exact distribution of the waiting time for the first k-match is obtained when the underlying sequence is generated by higher order Markov dependent trials. Examples for numerical calculations are also given.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号