An O(n log n) algorithm for finding all repetitions in a string
Journal of Algorithms
Two-dimensional periodicity and its applications
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
An Alphabet Independent Approach to Two-Dimensional Pattern Matching
SIAM Journal on Computing
String matching in Lempel-Ziv compressed strings
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Alphabet-Independent Two-Dimensional Witness Computation
SIAM Journal on Computing
Optimal two-dimensional compressed matching
Journal of Algorithms
Two-Dimensional Periodicity in Rectangular Arrays
SIAM Journal on Computing
Computer architecture (2nd ed.): a quantitative approach
Computer architecture (2nd ed.): a quantitative approach
Inplace run-length 2d compressed search
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Optimal Parallel Pattern Matching in Strings (Extended Summary)
Proceedings of the 12th Colloquium on Automata, Languages and Programming
CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts
CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching
Inplace 2D matching in compressed images
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Inplace 2D matching in compressed images
Journal of Algorithms
Context-free languages can be accepted with absolutely no space overhead
Information and Computation
Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Context-free languages can be accepted with absolutely no space overhead
Information and Computation
Computation with absolutely no space overhead
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Hardness of comparing two run-length encoded strings
Journal of Complexity
Small-space 2D compressed dictionary matching
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Hi-index | 5.24 |
The recent explosion in the amount of stored data has necessitated the storage and transmission of data in compressed form. The need to quickly access this data has given rise to a new paradigm in searching, that of compressed matching (Proc. Data Compression Conf, Snow Bird, UT, 1992, pp. 279-288; Proc. 8th Annu. Symp. on Combinatorial Pattern Matching (CPM 97), Lecture Notes in Computer Science, Vol. 1264, Springer, Berlin, 1997, pp. 40-51; Proc. 7th Annu. Symp. on Combinatorial Pattern Matching (CPM 96), Lecture Notes in Computer Science, Vol. 1075, Springer, Berlin, 1996, pp. 39-49). The goal of the compressed pattern matching problem is to find a pattern in a text without decompressing the text.The criterion of extra space is very relevant to compressed searching. An algorithm is called inplace if the amount of extra space used is proportional to the input size of the pattern. In this paper we present a 2d compressed matching algorithm that is inplace. Let compressed(T) and compressed(P) denote the compressed text and pattern, respectively. The algorithm presented in this paper runs in time O(|compressed(T)| + |P|log σ) where σ is min(|P|,|Σ), and Σ is the alphabet, for all patterns that have no trivial rows (rows consisting of a single repeating symbol). The amount of space used is O(|compressed(P)|). The compression used is the 2d run-length compression, used in FAX transmission.