Zobrazeno 1 - 10
of 996
pro vyhledávání: '"A. Gabric"'
Autor:
Gabrić, Daniel, Sawada, Joe
An orientable sequence of order $n$ over an alphabet $\{0,1,\ldots, k{-}1\}$ is a cyclic sequence such that each length-$n$ substring appears at most once \emph{in either direction}. When $k= 2$, efficient algorithms are known to construct binary ori
Externí odkaz:
http://arxiv.org/abs/2407.07029
Autor:
Gabric, Daniel, Sawada, Joe
An orientable sequence of order $n$ is a cyclic binary sequence such that each length-$n$ substring appears at most once \emph{in either direction}. Maximal length orientable sequences are known only for $n\leq 7$, and a trivial upper bound on their
Externí odkaz:
http://arxiv.org/abs/2401.14341
Autor:
Gabric, Daniel
A \emph{border} of a word $w$ is a word that is both a non-empty proper prefix and suffix of $w$. If $w$ has a border, then it is said to be \emph{bordered}; otherwise, it is said to be \emph{unbordered}. The main results of this paper are the first
Externí odkaz:
http://arxiv.org/abs/2305.03000
Autor:
Gabric, Daniel, Shallit, Jeffrey
A \emph{palindrome} is a word that reads the same forwards and backwards. A \emph{block palindrome factorization} (or \emph{BP-factorization}) is a factorization of a word into blocks that becomes palindrome if each identical block is replaced by a d
Externí odkaz:
http://arxiv.org/abs/2302.13147
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Rebecca L. Jackson, Matthew T. Woodhouse, Albert J. Gabric, Roger A. Cropp, Hilton B. Swan, Elisabeth S. M. Deschaseaux, Haydn Trounce
Publikováno v:
Frontiers in Marine Science, Vol 11 (2024)
Externí odkaz:
https://doaj.org/article/6120a32c04284f0d98b5fd578b6396a8
Autor:
Gabric, Daniel
A word~$w$ has a border $u$ if $u$ is a non-empty proper prefix and suffix of $u$. A word~$w$ is said to be \emph{closed} if $w$ is of length at most $1$ or if $w$ has a border that occurs exactly twice in $w$. A word~$w$ is said to be \emph{privileg
Externí odkaz:
http://arxiv.org/abs/2206.14273
Autor:
Harth, Florian M., Gabrič, Maja, Teržan, Janvit, Hočevar, Brigita, Gyergyek, Sašo, Likozar, Blaž, Grilc, Miha
Publikováno v:
In Catalysis Today 1 November 2024 441
Autor:
Gabric, Daniel
The \emph{Hamming distance} $\text{ham}(u,v)$ between two equal-length words $u$, $v$ is the number of positions where $u$ and $v$ differ. The words $u$ and $v$ are said to be \emph{conjugates} if there exist non-empty words $x,y$ such that $u=xy$ an
Externí odkaz:
http://arxiv.org/abs/2110.01120
Autor:
Kokot, Hana, Kokot, Boštjan, Pišlar, Anja, Esih, Hana, Gabrič, Alen, Urbančič, Dunja, El, Rojbin, Urbančič, Iztok, Pajk, Stane
Publikováno v:
In Bioorganic Chemistry September 2024 150