String Sanitization Under Edit Distance Inproceedings
In: 31st Annual Symposium on Combinatorial Pattern Matching (CPM), pp. 7:1–7:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
Hide and Mine in Strings: Hardness and Algorithms Inproceedings
In: 20th (IEEE) International Conference on Data Mining (ICDM), pp. 924–929, IEEE, 2020.
Substring Complexity in Sublinear Space Journal Article
In: CoRR, vol. abs/2007.08357, 2020.
Even Faster Elastic-Degenerate String Matching via Fast Matrix Multiplication Inproceedings
In: 46th International Colloquium on Automata, Languages, and Programming, (ICALP), pp. 21:1–21:15, 2019.
A Rearrangement Distance for Fully-Labelled Trees Inproceedings
In: 30th Annual Symposium on Combinatorial Pattern Matching (CPM), pp. 28:1–28:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
String Sanitization: A Combinatorial Approach Inproceedings
In: Machine Learning and Knowledge Discovery in Databases - European Conference (ECML-PKDD), pp. 627–644, Springer, 2019.
MALVA: genotyping by Mapping-free ALlele detection of known VAriants Journal Article
In: Iscience, vol. 18, pp. 20–27, 2019.
Degenerate String Comparison and Applications Inproceedings
In: 18th International Workshop on Algorithms in Bioinformatics, (WABI), pp. 21:1–21:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
Longest Property-Preserved Common Factor Inproceedings
In: String Processing and Information Retrieval - 25th International Symposium (SPIRE), pp. 42–49, Springer, 2018.
Pattern Matching on Elastic-Degenerate Text with Errors Inproceedings
In: 24th International Symposium on String Processing and Information Retrieval (SPIRE), pp. 74–90, 2017.