Abstract
Giancarlo's s-trees [9] has been the most efficient data structure for representing a library of text matrices such that we can efficiently search for the occurrences of any pattern matrix in the library, and update the library dynamically through insertion and deletion of texts. This paper presents a new scheme which improves the s-trees and provides faster algorithms for each above-mentioned operation. In particular, this scheme, though allowing the library to change dynamically, can search for a pattern as fast as the currently best algorithm designed for the static case, in which the text matrices are all fixed in advance.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Apostolico and Z. Galil, editors, Combinatorial Algorithms on Words, Springer-Verlag, New York, 1985.
A. Amir, G. Benson, M. Frach, Alphabet independent two dimensional matching, Proc. 24th Annual ACM Symposium on the Theory of Computing, 1992, 59–68.
A. Amir, M. Farach, R. Idury, J.L. Poutre, and A. Schäffer, Improved dynamic dictionary matching, Proc. 4th Annual ACM-SIAM Symposium on Discrete Algorithms, 1993, 392–401.
A. Amir, G.M. Landau, and U. Vishkin, Efficient pattern matching with scaling, Proc. 1st Annual ACM-SIAM Symposium on Discrete Algorithms, 1990, 344–357.
T.J. Baker, A technique for extending rapid exact-match string matching to arrays of more than one dimension, SIAM J. of Computing, 7 (1978), 533–541.
R.S. Bird, Two dimensional pattern matching, Information Processing Letters, 6 (1978), 168–179.
Z. Galil and K. Park, A truly alphabet independent two-dimensional pattern matching algorithm, Proc. 33th Annual IEEE Symposium on Foundations of Computer Science, 1992, 247–256.
R. Giancarlo, The suffix of a square matrix, with applications, Proc. 4th Annual ACM-SIAM Symposium on Discrete Algorithms, 1993, 402–411.
R. Giancarlo, An index data structure for matrices, with applications to fast two-dimensional pattern matching, Proc. 3rd Workshop on Algorithms and Data Structures, 1993, 337–348.
G.H. Gonnet, Efficient searching of text and pictures-extended abstract, Technical Report, University of Waterloo, OED-88-02, 1988.
R.M. Idury and A.A. Schäffer, Multiple matching of rectangular patterns, Proc. 25th Annual ACM Symposium on Theory of Computing, 1993, 81–89.
E.M. McCreight, A space-economical suffix tree construction algorithm, J. of ACM, 23 (1976), 262–272.
D.D. Sleator and R.E. Tarjan, A data structure for dynamic trees, Journal of Computer and System Sciences, 26 (1983), 362–391.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Choi, Y., Lam, T.W. (1995). Two-dimensional pattern matching on a dynamic library of texts. In: Du, DZ., Li, M. (eds) Computing and Combinatorics. COCOON 1995. Lecture Notes in Computer Science, vol 959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030874
Download citation
DOI: https://doi.org/10.1007/BFb0030874
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60216-3
Online ISBN: 978-3-540-44733-7
eBook Packages: Springer Book Archive