The Shift-Match Number and String Matching Probabilities for Binary Sequences
A. H. Bilge, A. Erzan, D. Balcan
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.
Create a lesson
Related papers
Large Language Model Agents for Evidence Based Genetic Disease Severity Classification
Tohid Ghasemnejad, Ahmadreza Argha, Mark Grosser et al.
STUART: Sequence Triage and qUAntification of Read Transcripts for Rapid Ionizing Radiation Exposure Assessment
Tomasz Strzoda, Lourdes Cruz-Garcia, Mustafa Najim et al.
PlainMap: a lightweight, restartable mapping pipeline for ancient and modern DNA
Michael V. Westbury
Democratizing Clinical Tumor Whole Genome Sequencing: 18-hour End-to-end Analysis via Trillion-parameter Large Language Models Locally Deployed on Consumer-grade Hardware
Rui Xiao, Yili Xu
Structure is not mechanism: high-gain gated-FFN rows across text and genomic foundation models
Alexandros Tzanakakis, Aris Karatzikos, Ilias Georgakopoulos-Soares
RAGCell: Retrieval-Augmented Generation as Supervision for Versatile Single-cell Analysis
Tianyu Liu, Fan Zhang, Jiayuan Chen et al.