1 citations · 2 across the 3 of their papers we have counts for
3 papers · 1 filter
Minimizing the Minimizers via Alphabet Reordering
Hilde Verbeek, Lorraine A. K. Ayad, Grigorios Loukides +1
Minimizers sampling is one of the most widely-used mechanisms for sampling strings [Roberts et al., Bioinformatics 2004]. Let be a string over a totally ordered…
Maximizing approximately k-submodular functions
Leqian Zheng, Hau Chan, Grigorios Loukides +1
We introduce the problem of maximizing approximately -submodular functions subject to size constraints. In this problem, one seeks to select -disjoint subsets of a ground set…
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…