1 citations · 3 across the 4 of their papers we have counts for
4 papers · 1 filter
Efficiently Finding All Minimal and Shortest Absent Subsequences in a String
Florin Manea, Tina Ringleb, Stefan Siemer +1
Given a string , another string is said to be a subsequence of if can be obtained from by removing some of its letters; on the other hand, is called an absen…
Longest Common Subsequence with Gap Constraints
Duncan Adamson, Maria Kosche, Tore Koß +2
We consider the longest common subsequence problem in the context of subsequences with gap constraints. In particular, following Day et al. 2022, we consider the setting when the d…
Matching Patterns with Variables under Hamming Distance
Paweł Gawrychowski, Florin Manea, Stefan Siemer
A pattern is a string of variables and terminal letters. We say that matches a word , consisting only of terminal letters, if can be obtained by replacing the variab…
The Edit Distance to -Subsequence Universality
Pamela Fleischmann, Maria Kosche, Tore Koß +2
A word is a subsequence of another word if can be obtained from by deleting some of its letters. The word with alph is called -subsequence universal i…