20 citations · 86 across the 21 of their papers we have counts for
31 papers
Expected Density of Random Minimizers
Shay Golan, Arseny M. Shur
Minimizer schemes, or just minimizers, are a very important computational primitive in sampling and sketching biological strings. Assuming a fixed alphabet of size , a minimizer…
String 2-Covers with No Length Restrictions
Itai Boneh, Shay Golan, Arseny Shur
A -cover of a string is a set of strings such that every index in is contained in an occurrence of at least one string . The existence of a -cover…
Power-free Complementary Binary Morphisms
Jeffrey Shallit, Arseny M. Shur, Stefan Zorcic
We revisit the topic of power-free morphisms, focusing on the properties of the class of complementary morphisms. Such morphisms are defined over a -letter alphabet, and map the…
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…
Distance Labeling for Families of Cycles
Arseny M. Shur, Mikhail Rubinchik
For an arbitrary finite family of graphs, the distance labeling problem asks to assign labels to all nodes of every graph in the family in a way that allows one to recover the dist…
On minimal critical exponent of balanced sequences
Lubomíra Dvořáková, Daniela Opočenská, Edita Pelantová +1
We study the threshold between avoidable and unavoidable repetitions in infinite balanced sequences over finite alphabets. The conjecture stated by Rampersad, Shallit and Vandomme…