TY - GEN
T1 - Finding witnesses by peeling
AU - Aumann, Yonatan
AU - Lewenstein, Moshe
AU - Lewenstein, Noa
AU - Tsur, Dekel
PY - 2007/1/1
Y1 - 2007/1/1
N2 - In the k-matches problem, we are given a pattern and a text, and for each text location the goal is to list all, but not more than k, matches between the pattern and the text. This problem is one of several string matching problems that ask to not only to find where the pattern matches the text, under different "match" definitions, but also to provide witnesses to the match. Other such problems include: k-aligned ones [4], k-witnesses, and k-mismatches [18]. In addition, the solution to several other string matching problems relies on the efficient solution of the witness finding problems. In this paper we provide a general efficient method for solving such witness finding problems. We do so by casting the problem as a generalization of group testing, which we then solve by a process which we call peeling. Using this general framework we obtain improved results for all of the above problems. We also show that our method also solves a couple of problems outside the pattern matching domain.
AB - In the k-matches problem, we are given a pattern and a text, and for each text location the goal is to list all, but not more than k, matches between the pattern and the text. This problem is one of several string matching problems that ask to not only to find where the pattern matches the text, under different "match" definitions, but also to provide witnesses to the match. Other such problems include: k-aligned ones [4], k-witnesses, and k-mismatches [18]. In addition, the solution to several other string matching problems relies on the efficient solution of the witness finding problems. In this paper we provide a general efficient method for solving such witness finding problems. We do so by casting the problem as a generalization of group testing, which we then solve by a process which we call peeling. Using this general framework we obtain improved results for all of the above problems. We also show that our method also solves a couple of problems outside the pattern matching domain.
UR - https://www.scopus.com/pages/publications/37849005467
U2 - 10.1007/978-3-540-73437-6_6
DO - 10.1007/978-3-540-73437-6_6
M3 - Conference contribution
AN - SCOPUS:37849005467
SN - 9783540734369
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 28
EP - 39
BT - Combinatorial Pattern Matching - 18th Annual Symposium, CPM 2007, Proceedings
PB - Springer Verlag
T2 - 18th Annual Symposium on Combinatorial Pattern Matching, CPM 2007
Y2 - 9 July 2007 through 11 July 2007
ER -