4 citations · 4 across the 2 of their papers we have counts for
4 papers
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 and of lengths and , respectiv…
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…
Searching 2D-Strings for Matching Frames
Itai Boneh, Dvir Fried, Shay Golan +3
We introduce the natural notion of a matching frame in a -dimensional string. A matching frame in a -dimensional string , is a rectangle such that the strings…
An Improved Algorithm for The -Dyck Edit Distance Problem
Dvir Fried, Shay Golan, Tomasz Kociumaka +3
A Dyck sequence is a sequence of opening and closing parentheses (of various types) that is balanced. The Dyck edit distance of a given sequence of parentheses is the smallest…