7 citations · 7 across the 5 of their papers we have counts for
14 papers · 1 filter
Subsequence Covers of Words
Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski +3
We introduce subsequence covers (s-covers, in short), a new type of covers of a word. A word is an s-cover of a word if the occurrences of in as subsequences cover…
Tight Bound for the Number of Distinct Palindromes in a Tree
Paweł Gawrychowski, Tomasz Kociumaka, Wojciech Rytter +1
For an undirected tree with edges labelled by single letters, we consider its substrings, which are labels of the simple paths between pairs of nodes. We prove that there are $…
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…
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…
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…