The Distribution of Short Word Match Counts between Markovian Sequences

被引：0

作者：

Burden, Conrad J. ^{[1
]}

Leopardi, Paul ^{[1
]}

Foret, Sylvain ^{[2
]}

机构：

[1] Australian Natl Univ, Math Sci Inst, GPO Box 4, Canberra, ACT 0200, Australia

[2] Australian Natl Univ, Res Sch Biol, Canberra, ACT 0200, Australia

来源：

BIOINFORMATICS 2013: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON BIOINFORMATICS MODELS, METHODS AND ALGORITHMS | 2013年

基金：

澳大利亚研究理事会;

关键词：

Word Matches; Biological Sequence Comparison;

D O I：

暂无

中图分类号：

R-058 [];

学科分类号：

摘要：

The D-2 statistic, which counts the number of word matches between two given sequences, has long been proposed as a measure of similarity for biological sequences. Much of the mathematically rigorous work carried out to date on the properties of the D-2 statistic has been restricted to the case of 'Bernoulli' sequences composed of identically and independently distributed letters. Here the properties of the distribution of this statistic for the biologically more realistic case of Markovian sequences is studied. The approach is novel in that Markovian dependency is defined for sequences with periodic boundary conditions, and this enables exact analytic formulae for the mean and variance to be derived. The formulae are confirmed using numerical simulations, and asymptotic approximations to the full distribution are tested.

引用

页码：25 / 33

页数：9

共 50 条

[21] Upper estimation boundary for absolute maximum distribution for a process represented by Markovian sequences
Yevgrafov D.V.
[J]. Radioelectronics and Communications Systems, 2011, 54 (12) : 669 - 674
[22] Approximate word matches between two random sequences
Burden, Conrad J.
Kantorovitz, Miriam R.
Wilson, Susan R.
[J]. ANNALS OF APPLIED PROBABILITY, 2008, 18 (01): : 1 - 21
[23] Convergence in distribution for subset counts between random sets
Stark, D
[J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2004, 11 (01):
[24] Numerical comparison of several approximations of the word count distribution in random sequences
Robin, S
Schbath, S
[J]. JOURNAL OF COMPUTATIONAL BIOLOGY, 2001, 8 (04) : 349 - 359
[25] Converting between word and syllable counts in children's conversational speech samples
Yaruss, JS
[J]. JOURNAL OF FLUENCY DISORDERS, 2000, 25 (04) : 305 - 316
[26] Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences
Sylvain Forêt
Miriam R Kantorovitz
Conrad J Burden
[J]. BMC Bioinformatics, 7
[27] Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences
Foret, Sylvain
Kantorovitz, Miriam R.
Burden, Conrad J.
[J]. BMC BIOINFORMATICS, 2006, 7 (Suppl 5) : S21
[28] Reconstruction of Recurring Pulses From Distribution of Short Sequences of Samples
Rupniewski, Marek W.
[J]. IEEE SIGNAL PROCESSING LETTERS, 2024, 31 : 396 - 400
[29] Classification of various genomic sequences based on distribution of repeated k-word
Song, Yong-Joon
Cho, Dong-Ho
[J]. 2017 39TH ANNUAL INTERNATIONAL CONFERENCE OF THE IEEE ENGINEERING IN MEDICINE AND BIOLOGY SOCIETY (EMBC), 2017, : 3894 - 3897
[30] On finding short reconfiguration sequences between independent sets ☆
Agrawal, Akanksha
Hait, Soumita
Mouawad, Amer E.
[J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2025, 147

← 1 2 3 4 5 →