arXiv · q-bio/0409023
The Shift-Match Number and String Matching Probabilities for Binary Sequences
Abstract
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
A. H. Bilge, A. Erzan, D. Balcan. 2004-09-21. The Shift-Match Number and String Matching Probabilities for Binary Sequences. https://arxiv.org/abs/q-bio/0409023
Cite the original work for its findings. Save a collection to share your selection of sources.