核心概念
The author presents improved algorithms for string sanitization under edit distance, addressing privacy concerns while maintaining data utility.
摘要
The content discusses the ETFS problem, proposing optimal solutions and techniques for efficient computation. It also introduces algorithms to handle sensitive patterns of arbitrary lengths.
統計資料
ETFS can be solved in O(n2k) time.
The AETFS problem can be solved in O(k|I|n + Ln) time.
The ETFS-DP algorithm solves the ETFS problem efficiently.