Zobrazeno 1 - 10
of 91
pro vyhledávání: '"Mercaş, Robert"'
Autor:
Mercaş, Robert, Teh, Wen Chean
The focus of this work is the study of Parikh matrices with emphasis on two concrete problems. In the first part of our presentation we show that a conjecture by Dick at al. in 2021 only stands in the case of ternary alphabets, while providing counte
Externí odkaz:
http://arxiv.org/abs/2410.15004
In this paper, we study a series of algorithmic problems related to the subsequences occurring in the strings of a given language, under the assumption that this language is succinctly represented by a grammar generating it, or an automaton accepting
Externí odkaz:
http://arxiv.org/abs/2410.07992
Autor:
Mercas, Robert
Publikováno v:
TDX (Tesis Doctorals en Xarxa).
El objeto de esta tesis está representado por las repeticiones de palabras parciales, palabras que, además de las letras regulares, pueden tener un número de símbolos desconocidos,llamados símbolos "agujeros" o "no sé qué". Más concretamente,
Externí odkaz:
http://hdl.handle.net/10803/8801
Autor:
Fazekas, Szilárd Zsolt, Mercaş, Robert
We study the sweep complexity of DFA in one-way jumping mode answering several questions posed earlier. This measure is the number of times in the worst case that such machines have to return to the beginning of their input after having skipped some
Externí odkaz:
http://arxiv.org/abs/2308.06683
Autor:
Charalampopoulos, Panagiotis, Crochemore, Maxime, Fici, Gabriele, Mercas, Robert, Pissis, Solon P.
Sequence comparison is a prerequisite to virtually all comparative genomic analyses. It is often realised by sequence alignment techniques, which are computationally expensive. This has led to increased research into alignment-free techniques, which
Externí odkaz:
http://arxiv.org/abs/1806.02718
Autor:
Mercaş, Robert, Nowotka, Dirk
In this work we improve on a result from~\cite{GryKosZma15}. In particular, we investigate the situation where a word is constructed jointly by two players who alternately append letters to the end of an existing word. One of the players (Ann) tries
Externí odkaz:
http://arxiv.org/abs/1601.02453
Autor:
Mercaş, Robert
In this note we present a characterisation of all unary and binary patterns that do not only contain variables, but also reversals of their instances. These types of variables were studied recently in either more general or particular cases. We show
Externí odkaz:
http://arxiv.org/abs/1508.04571
Sequence comparison is a prerequisite to virtually all comparative genomic analyses. It is often realized by sequence alignment techniques, which are computationally expensive. This has led to increased research into alignment-free techniques, which
Externí odkaz:
http://arxiv.org/abs/1506.04917
Autor:
Crochemore, Maxime, Mercas, Robert
The work takes another look at the number of runs that a string might contain and provides an alternative proof for the bound. We also propose another stronger conjecture that states that, for a fixed order on the alphabet, within every factor of a w
Externí odkaz:
http://arxiv.org/abs/1412.4646