Differentially private approximate pattern matching

TA Steiner - arXiv preprint arXiv:2311.07415, 2023 - arxiv.org
In this paper, we consider the $ k $-approximate pattern matching problem under differential
privacy, where the goal is to report or count all substrings of a given string $ S $ which have …

Missing value replacement in strings and applications

G Bernardini, C Liu, G Loukides… - Data Mining and …, 2025 - Springer
Missing values arise routinely in real-world sequential (string) datasets due to:(1) imprecise
data measurements;(2) flexible sequence modeling, such as binding profiles of molecular …

On Breaking Truss-based and Core-based Communities

H Chen, A Conte, R Grossi, G Loukides… - ACM Transactions on …, 2024 - dl.acm.org
We introduce the general problem of identifying a smallest edge subset of a given graph
whose deletion makes the graph community-free. We consider this problem under two …

Sketch-based approaches to process massive string data

G Gourdel - 2023 - theses.hal.science
The simplicity of strings and their impactful usage puts their processing at the heart of many
applications, including Bioinformatics, Information Retrieval, and Cybersecurity. Exact …

Application of Data Mining Technology in the Construction of Cultural Confidence System

L Xu - 2023 3rd International Conference on Smart …, 2023 - ieeexplore.ieee.org
Red culture is the precious spiritual wealth left by China's revolutionary predecessors and
one of the sources of strength to promote social progress and development. Therefore …

[PDF][PDF] Algorithms for string and graph data protection

H Chen - ACM Journal of Experimental Algorithmics (JEA), 2021 - kclpure.kcl.ac.uk
The growth in data volume has led to an increasing interest in analyzing data about
individuals in domains ranging from marketing to biomedical informatics. Therefore, data …