The Shift-Match Number and String Matching Probabilities for Binary Sequences
基因组学
2007-05-23 v1 定量方法
摘要
We define the ``shift-match number'' for a binary string and we compute the probability of occurrence of a given string as a subsequence in longer strings in terms of its shift-match number. We thus prove that the string matching probabilities depend not only on the length of shorter strings, but also on the equivalence class of the shorter string determined by its shift-match number.
引用
@article{arxiv.q-bio/0409023,
title = {The Shift-Match Number and String Matching Probabilities for Binary Sequences},
author = {A. H. Bilge and A. Erzan and D. Balcan},
journal= {arXiv preprint arXiv:q-bio/0409023},
year = {2007}
}
备注
17 pages, 2 figures