In the pattern matching problem, there can be a quadratic number of matching substrings in the size of a given text. The linearizing restriction finds, at most, a linear number of...
In this paper we describe a new class of representations for realvalued parameters called Center of Mass Encoding (CoME). CoME is based on variable length strings, it is self-adap...
During the last years, the use of string kernels that compare documents has been shown to achieve good results on text classification problems. In this paper we introduce the appl...
We investigate the problem of the maximum number of cubic subwords (of the form www) in a given word. We also consider square subwords (of the form ww). The problem of the maximum ...
Marcin Kubica, Jakub Radoszewski, Wojciech Rytter,...
Abstract. Sequence alignment is an important task for molecular biologists. Because alignment basically deals with approximate string matching on large biological sequence collecti...