29 citations · 45 across the 41 of their papers we have counts for
5 papers · 1 filter
Efficient Pattern Matching in Elastic-Degenerate Strings
Costas Iliopoulos, Ritu Kundu, Solon Pissis
In this paper, we extend the notion of gapped strings to elastic-degenerate strings. An elastic-degenerate string can been seen as an ordered collection of k > 1 seeds (substrings/…
Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka +5
Longest common extension queries (LCE queries) and runs are ubiquitous in algorithmic stringology. Linear-time algorithms computing runs and preprocessing for constant-time LCE que…
Optimal Computation of Avoided Words
Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao +4
The deviation of the observed frequency of a word from its expected frequency in a given sequence is used to determine whether or not the word is avoided. This concept is p…
Pattern Matching and Consensus Problems on Weighted Sequences and Profiles
Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski
We study pattern matching problems on two major representations of uncertain sequences used in molecular biology: weighted sequences (also known as position weight matrices, PWM) a…
Efficient Index for Weighted Sequences
Carl Barton, Tomasz Kociumaka, Solon P. Pissis +1
The problem of finding factors of a text string which are identical or similar to a given pattern string is a central problem in computer science. A generalised version of this pro…