Dvir Fried

collaborators

3 papers

cs.DS2024

Hamming Distance Oracle

Itai Boneh, Dvir Fried, Shay Golan +1

In this paper, we present and study the \emph{Hamming distance oracle problem}. In this problem, the task is to preprocess two strings $S$ and $T$ of lengths $n$ and $m$ , respectiv…

cs.DS2024

Searching 2D-Strings for Matching Frames

Itai Boneh, Dvir Fried, Shay Golan +3

We introduce the natural notion of a matching frame in a $2$ -dimensional string. A matching frame in a $2$ -dimensional $n \times m$ string $M$ , is a rectangle such that the strings…

cs.DS2024

Hairpin Completion Distance Lower Bound

Itai Boneh, Dvir Fried, Shay Golan +1

Hairpin completion, derived from the hairpin formation observed in DNA biochemistry, is an operation applied to strings, particularly useful in DNA computing. Conceptually, a right…