4 papers
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…
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…