36 citations · 92 across the 24 of their papers we have counts for
6 papers · 1 filter
Internal Dictionary Matching
Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed +3
We introduce data structures answering queries concerning the occurrences of patterns from a given dictionary in fragments of a given string of length . The di…
Weighted Shortest Common Supersequence Problem Revisited
Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis +5
A weighted string, also known as a position weight matrix, is a sequence of probability distributions over some alphabet. We revisit the Weighted Shortest Common Supersequence (WSC…
On the cyclic regularities of strings
Oluwole Ajala, Miznah Alshammary, Mai Alzamel +5
Regularities in strings are often related to periods and covers, which have extensively been studied, and algorithms for their efficient computation have broad application. In this…
Circular Pattern Matching with Mismatches
Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis +5
The -mismatch problem consists in computing the Hamming distance between a pattern of length and every length- substring of a text of length , if this distance…
Syntactic View of Sigma-Tau Generation of Permutations
Wojciech Rytter, Wiktor Zuba
We give a syntactic view of the Sawada-Williams -generation of permutations. The corresponding sequence of -operations, of length is shown to be highly compressi…
Quasi-Linear-Time Algorithm for Longest Common Circular Factor
Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos +6
We introduce the Longest Common Circular Factor (LCCF) problem in which, given strings and of length , we are to compute the longest factor of whose cyclic shift occ…