Regular ArticleMulti-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms☆,☆☆
References (38)
- et al.
The subtree max gap problem with application to parallel string covering
Inform. and Comput.
(1995) Dictionary-matching on unbounded alphabets: Uniform length dictionaries
J. Algorithms
(1995)- et al.
Faster optimal parallel prefix sums and list ranking
Inform. and Comput.
(1989) On saving space in parallel computation
Inform. Process. Lett.
(1988)Fast deterministic processor allocation
J. Algorithms
(1995)- et al.
A data structure for dynamic trees
J. Comput. System Sci.
(1983) Algorithms for finding pattern in strings
Handbook of Theoretical Computer Science
(1990)- A. Amir, G. Benson, Two-dimensional periodicity and its applications, Proceedings of ACM–SIAM Symposium on Discrete...
- et al.
An alphabet independent approach to two-dimensional pattern matching
SIAM J. Comput.
(1994) The myriad virtues of subword trees
Parallel construction of a suffix tree with applications
Algorithmica
(1988)
The Design and Analysis of Computer Algorithms
(1974)
The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time
Algorithmica
(1988)
Parallel prefix computation
Assoc. Comput. Mach.
(1980)
String matching and other products
An index data structure for matrices, with applications to fast two-dimensional pattern matching
Proceedings, Workshop on Algorithms and Data Structures
(1993)
Cited by (11)
Generalizations of suffix arrays to multi-dimensional matrices
2003, Theoretical Computer ScienceGeneralizations of suffix arrays to multi-dimensional matrices
2003, Theoretical Computer ScienceDistance measure for video sequences
1999, Computer Vision and Image UnderstandingParallel construction and query of index data structures for pattern matching on square Matrices
1999, Journal of ComplexityImage Analysis and Computer Vision: 1997
1998, Computer Vision and Image UnderstandingTree-based 2D indexing
2011, International Journal of Foundations of Computer Science
- ☆
Work partially supported by MURST of Italy. An extended abstract related to this paper has been presented at the 6th Annual Symposium on Combinatorial Pattern Matching, Helsinki, 1995.
- ☆☆
J. van Leeuwen, Ed.
- †
Part of this work was done while the author was a member of technical staff at AT&T Bell Laboratories, Murray Hill, NJ 07974, U.S.A. E-mail: [email protected].
- ‡
Part of this work was done while the author was visiting AT&T Bell Laboratories. E-mail: [email protected].
Copyright © 1997 Academic Press. All rights reserved.