Zobrazeno 1 - 10
of 268
pro vyhledávání: '"Golan Shay"'
Autor:
Hoffman Azik, Nativ Omri, Malshy Kamil, Haifler Miki, Golan Shay, Mano Roy, Freifeld Yuval, Rosenzweig Barak, Shalom Ben, Stabholz Yariv, Ben-David Reuven, Amiel E. Gilad
Publikováno v:
Discover Oncology, Vol 15, Iss 1, Pp 1-7 (2024)
Abstract Introduction Bilateral testicular germ cell tumor (BGCT) is a rare disease, occasionally considered to be more aggressive than unilateral germ cell tumors (GCT) in some reports. Among BGCT, a synchronous disease might be diagnosed at a highe
Externí odkaz:
https://doaj.org/article/a198d971a9ae474897ba9e419ebf1577
Autor:
Golan, Shay, Shur, Arseny M.
Minimizer schemes, or just minimizers, are a very important computational primitive in sampling and sketching biological strings. Assuming a fixed alphabet of size $\sigma$, a minimizer is defined by two integers $k,w\ge2$ and a total order $\rho$ on
Externí odkaz:
http://arxiv.org/abs/2410.16968
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$, respectively, to obtain a data-structure that is able to answer queries regardi
Externí odkaz:
http://arxiv.org/abs/2407.05430
A $\lambda$-cover of a string $S$ is a set of strings $\{C_i\}_1^\lambda$ such that every index in $S$ is contained in an occurrence of at least one string $C_i$. The existence of a $1$-cover defines a well-known class of quasi-periodic strings. Quas
Externí odkaz:
http://arxiv.org/abs/2405.11475
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 hairpin completion operation transforms a string $S$ into $S\cdot S'$
Externí odkaz:
http://arxiv.org/abs/2404.11673
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 written on the horizontal sides of the rectangle are identical, and so
Externí odkaz:
http://arxiv.org/abs/2310.02670
We give an $\tilde O(n^2)$ time algorithm for computing the exact Dynamic Time Warping distance between two strings whose run-length encoding is of size at most $n$. This matches (up to log factors) the known (conditional) lower bound, and should be
Externí odkaz:
http://arxiv.org/abs/2302.06252
Autor:
Fried, Dvir, Golan, Shay, Kociumaka, Tomasz, Kopelowitz, Tsvi, Porat, Ely, Starikovskaya, Tatiana
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 $S$ is the smallest number of edit operations (insertions, deletions, and substitutions) n
Externí odkaz:
http://arxiv.org/abs/2111.02336
Autor:
Savin, Ziv, Mano, Roy, Lazarovich, Alon, Rosenzweig, Barak, Shashar, Reut, Hoffman, Azik, Pilosov, Ilona, Freifeld, Yuval, Shpitzer, Sagi Arieh, Golan, Shay, Yossepowitch, Ofer, Sofer, Mario
Publikováno v:
In Clinical Genitourinary Cancer April 2024 22(2):491-496
The shift distance $\mathsf{sh}(S_1,S_2)$ between two strings $S_1$ and $S_2$ of the same length is defined as the minimum Hamming distance between $S_1$ and any rotation (cyclic shift) of $S_2$. We study the problem of sketching the shift distance,
Externí odkaz:
http://arxiv.org/abs/2006.13673