Finding witnesses by peeling.

*(English)*Zbl 1138.68382
Ma, Bin (ed.) et al., Combinatorial pattern matching. 18th annual symposium, CPM 2007, London, Canada, July 9–11, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73436-9/pbk). Lecture Notes in Computer Science 4580, 28-39 (2007).

Summary: 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, \(k\)-witnesses, and \(k\)-mismatches. 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.

For the entire collection see [Zbl 1136.68008].

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.

For the entire collection see [Zbl 1136.68008].