Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abrahamson, K.: Generalized string matching. SIAM J. on Computing 16(6), 1039–1051 (1987)
Alon, N., Galil, Z., Margalit, O., Naor, M.: Witnesses for boolean matrix multiplication and for shortest paths. In: Symposium on Foundations of Computer Science (FOCS), pp. 417–426 (1992)
Alon, N., Naor, M.: Derandomization, witnesses for boolean matrix multiplication and construction of perfect hash functions. Algorithmica 16, 434–449 (1996)
Amir, A., Farach, M.: Efficient 2-dimensional approximate matching of half-rectangular figures. Information and Computation 118(1), 1–11 (1995)
Amir, A., Lewenstein, M., Porat, E.: Faster algorithms for string matching with k mismatches. J. of Algorithms 50(2), 257–275 (2004)
Brito, C., Gafni, E., Vaya, S.: An information theoretic lower bound for broadcasting in radio networks. In: Proc. 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS), pp. 534–546 (2004)
Chlebus, B.S., Gasieniec, L., Gibbons, A., Pelc, A., Rytter, W.: Deterministic broadcasting in ad hoc radio networks. Distributed Computing 15(1), 27–38 (2002)
Clementi, A.E.F., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. In: Proc. 13th Symposium on Discrete Algorithms(SODA), pp. 709–718 (2001)
Damaschke, P.: Randomized group testing for mutually obscuring defectives. Information Processing Letters 67, 131–135 (1998)
Du, D.Z., Hwang, F.K.: Combinatorial group testing and its applications. World Scientific (2000)
Galil, Z., Giancarlo, R.: Improved string matching with k mismatches. SIGACT News. 17(4), 52–54 (1986)
Indyk, P.: Interpolation of symmetric functions and a new type of combinatorial design. In: Proc. of Symposium on Theory of Computing (STOC), pp. 736–740 (1999)
Indyk, P.: Explicit constructions of selectors and related combinatorial structures, with applications. In: Proc. 13th Symposium on Discrete Algorithms (SODA), pp. 697–704 (2002)
Knuth, D.E., Morris, J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comp. 6, 323–350 (1977)
Komlós, J., Greenberg, A.G.: An asymptotically nonadaptive algorithm for conflict resolution in multiple-access channels. IEEE Trans. on Information Theory 31(2), 302–306 (1985)
Landau, G.M., Vishkin, U.: Efficient string matching with k mismatches. Theoretical Computer Science 43, 239–249 (1986)
Muthukrishnan, S.: Personal communication
Muthukrishnan, S.: New results and open problems related to non-standard stringology. In: Galil, Z., Ukkonen, E. (eds.) Combinatorial Pattern Matching. LNCS, vol. 937, pp. 298–317. Springer, Heidelberg (1995)
Seidel, R.: On the all-pairs-shortest-path problem in unweighted undirected graphs. J. of Computer and System Sciences 51, 400–403 (1995)
Ta-Shma, A., Umans, C., Zuckerman, D.: Loss-less condensers, unbalanced expanders, and extractors. In: Proc. 33th Symposium on the Theory of Computing (STOC), pp. 143–152 (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aumann, Y., Lewenstein, M., Lewenstein, N., Tsur, D. (2007). Finding Witnesses by Peeling. In: Ma, B., Zhang, K. (eds) Combinatorial Pattern Matching. CPM 2007. Lecture Notes in Computer Science, vol 4580. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73437-6_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-73437-6_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73436-9
Online ISBN: 978-3-540-73437-6
eBook Packages: Computer ScienceComputer Science (R0)