On k-match problems☆
On k-match problems☆
复制标题
关于k匹配问题☆
DOI：
10.1016/s0378-3758(02)00299-9
复制
发表时间：
2003
影响因子：
0.9
通讯作者：
S. Aki
中科院分区：
文献类型：
--
作者：
K. Hirano;S. Aki
研究了在存储窗口大小为k的{1，2，.，m}值随机变量序列中的几个等待时间随机变量的复制问题。利用条件概率母函数方法，得到了等待时间随机变量的精确分布。特别地，当底层序列由高阶马尔可夫相关试验生成时，获得了第一个k-匹配的等待时间的精确分布。文中还给出了数值计算实例。
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.