29 citations · 45 across the 41 of their papers we have counts for
5 papers · 1 filter
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…
Combinatorial Algorithms for String Sanitization
Giulia Bernardini, Huiping Chen, Alessio Conte +6
String data are often disseminated to support applications such as location-based service provision or DNA sequence analysis. This dissemination, however, may expose sensitive patt…
Elastic-Degenerate String Matching via Fast Matrix Multiplication
Giulia Bernardini, Paweł Gawrychowski, Nadia Pisanti +2
An elastic-degenerate (ED) string is a sequence of sets of strings of total length , which was recently proposed to model a set of similar sequences. The ED string matching…
Constructing Antidictionaries in Output-Sensitive Space
Lorraine A. K. Ayad, Golnaz Badkobeh, Gabriele Fici +2
A word that is absent from a word is called minimal if all its proper factors occur in . Given a collection of words over an alphabet , we ar…