Publisher
Springer Nature Singapore
Reference23 articles.
1. Aho, A.V., Corasick, M.J.: Efficient string matching: an aid to bibliographic search. Commun. ACM 18(6), 333–340 (1975)
2. Bernardini, G., et al.: String sanitization: a combinatorial approach. In: Proceedings of 2019 European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD), pp. 627–644 (2019)
3. Bernardini, G., et al.: Combinatorial algorithms for string sanitization. ACM Trans. Knowl. Discov. Data 15(1), 1–34 (2021)
4. Bernardini, G., et al.: String sanitization under edit distance. In: Proceedings of 31st Annual Symposium on Combinatorial Pattern Matching (CPM), pp. 1–14 (2020)
5. Blum, A., Jiang, T., Li, M., Tromp, J., Yannakakis, M.: Linear approximation of shortest superstrings. J. ACM 41(4), 630–647 (1994)