{
  "annotation_id": "f457a98f-a250-422c-87c4-8b91ab8f0ac3",
  "date_created": "2026-03-02T18:01:32.171000Z",
  "date_modified": "2026-03-02T18:01:32.171000Z",
  "file_hash": "a8e9622c378def8d898ca1953e90b776ec4ce0b9d698e4e352fd1aa97a20d62c",
  "private": false,
  "record": {
    "abstract": "We define the ``shift-match number\u0027\u0027 for a binary string and we compute the\nprobability of occurrence of a given string as a subsequence in longer strings\nin terms of its shift-match number. We thus prove that the string matching\nprobabilities depend not only on the length of shorter strings, but also on the\nequivalence class of the shorter string determined by its shift-match number.",
    "arxiv_id": "q-bio/0409023",
    "authors": [
      "A. H. Bilge",
      "A. Erzan",
      "D. Balcan"
    ],
    "categories": [
      "q-bio.GN",
      "q-bio.QM"
    ],
    "title": "The Shift-Match Number and String Matching Probabilities for Binary   Sequences",
    "url": "https://arxiv.org/abs/q-bio/0409023"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "d98132fd-b344-4a8c-8894-f3c4fff370be",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}