The Shift-Match Number and String Matching Probabilities for Binary Sequences

Simple item page
dc.creatorBilge, A. H.
dc.creatorErzan, A.
dc.creatorBalcan, D.
dc.date2004-09-21
dc.date.accessioned2026-07-07T05:58:38Z
dc.date.available2026-07-07T05:58:38Z
dc.descriptionWe 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.
dc.description17 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/q-bio/0409023
dc.identifierhttp://arxiv.org/abs/q-bio/0409023
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/88433
dc.subjectGenomics
dc.subjectQuantitative Methods
dc.titleThe Shift-Match Number and String Matching Probabilities for Binary Sequences
dc.typetext

Files

Collections

arXiv