8 citations · 13 across the 8 of their papers we have counts for
10 papers
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…
Layered and Staged Monte Carlo Tree Search for SMT Strategy Synthesis
Zhengyang Lu, Stefan Siemer, Piyush Jha +3
Modern SMT solvers, such as Z3, offer user-controllable strategies, enabling users to tailor solving strategies for their unique set of instances, thus dramatically enhancing solve…
Matching Patterns with Variables Under Simon's Congruence
Pamela Fleischmann, Sungmin Kim, Tore Koß +4
We introduce and investigate a series of matching problems for patterns with variables under Simon's congruence. Our results provide a thorough picture of these problems' computati…
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…
Combinatorial Algorithms for Subsequence Matching: A Survey
Maria Kosche, Tore Koß, Florin Manea +1
In this paper we provide an overview of a series of recent results regarding algorithms for searching for subsequences in words or for the analysis of the sets of subsequences occu…
Matching Patterns with Variables Under Edit 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…
Absent Subsequences in Words
Maria Kosche, Tore Koß, Florin Manea +1
An absent factor of a string is a string which does not occur as a contiguous substring (a.k.a. factor) inside . We extend this well-studied notion and define absent sub…
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…
Efficiently Testing Simon's Congruence
Pawel Gawrychowski, Maria Kosche, Tore Koss +2
Simon's congruence is defined as follows: two words are -equivalent if they have the same set of subsequences of length at most . We propose an algorithm which…