2 citations · 5 across the 8 of their papers we have counts for
8 papers
On Minimizers of Minimum Density
Arseny Shur
Minimizers are sampling schemes with numerous applications in computational biology. Assuming a fixed alphabet of size , a minimizer is defined by two integers and a l…
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…
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…
Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams
Paweł Gawrychowski, Oleg Merkurev, Arseny M. Shur +1
We consider computing a longest palindrome in the streaming model, where the symbols arrive one-by-one and we do not have random access to the input. While computing the answer exa…
Lower Bounds on Words Separation: Are There Short Identities in Transformation Semigroups?
Andrei A. Bulatov, Olga Karpova, Arseny M. Shur +1
The words separation problem, originally formulated by Goralcik and Koubek (1986), is stated as follows. Let be the minimum number such that for any two words of length $\…