3 citations · 6 across the 9 of their papers we have counts for
10 papers
Subsequence Analysis Problems for Binary Parikh Matrices
Szilárd Zsolt Fazekas, Xinhao Huang, Robert Mercaş
The universality index corresponding to a word is the largest integer k such that every word of length k over the given alphabet occurs in it as a subsequence. Relative to language…
Binary Words Containing Few Abelian Squares
Szilard Zsolt Fazekas, Adam Mammoliti, Robert Mercas +1
Fici and Saarela ([2]) conjectured that a binary word of length n contains at least abelian squares. We slightly extend this conjecture and show that it holds…
Ternary is Still Good for Parikh Matrices
Robert Mercaş, Wen Chean Teh
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 202…
Subsequence Matching and Analysis Problems for Formal Languages
Szilárd Zsolt Fazekas, Tore Koß, Florin Manea +2
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 succin…
Sweep Complexity Revisited
Szilárd Zsolt Fazekas, Robert Mercaş
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 hav…
Alignment-free sequence comparison using absent words
Panagiotis Charalampopoulos, Maxime Crochemore, Gabriele Fici +2
Sequence comparison is a prerequisite to virtually all comparative genomic analyses. It is often realised by sequence alignment techniques, which are computationally expensive. Thi…
A note on Thue games
Robert Mercaş, Dirk Nowotka
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 l…
Linear-Time Sequence Comparison Using Minimal Absent Words & Applications
Maxime Crochemore, Gabriele Fici, Robert Mercaş +1
Sequence comparison is a prerequisite to virtually all comparative genomic analyses. It is often realized by sequence alignment techniques, which are computationally expensive. Thi…
Fewer runs than word length
Maxime Crochemore, Robert Mercas
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 stat…
Binary Patterns in Binary Cube-Free Words: Avoidability and Growth
Robert Mercas, Pascal Ochem, Alexei V. Samsonov +1
The avoidability of binary patterns by binary cube-free words is investigated and the exact bound between unavoidable and avoidable patterns is found. All avoidable patterns are sh…