A. Amir, G.M. Landau, and D. Sokol, Inplace Run-Length 2d Compressed Search, In Proceedings of 11th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'2000, San Francisco, pp. 817-818. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Approximate Matching of Run-Length Compressed Strings - Mäkinen, Navarro, Ukkonen (2001) (Correct)
....is just the product of the compressed lengths. Indeed, this seems possible in the average case, as demonstrated by the experiments with our improved algorithm for the LCS. Finally, a combination of a two dimensional approximate pattern matching algorithm with two dimensional run length compression [15, 6, 1, 3] seems interesting. ....
A. Amir, G. Landau, and D. Sokol. Inplace run-length 2d compressed search. Proc. 11th Symposium on Discrete Algorithms (SODA'00), pages 817-818, 2000.
Time/Space Efficient Compressed Pattern Matching - Gasieniec, Potapov (2001) (Correct)
....too, see e.g. 16] Only recently more space competitive algorithm that uses only linear (in the size of a dictionary) extra space was presented in [20] In contrast, our algorithm requires only constant extra space and it is independent on the size of dictionary. Also very recently Amir et al. in [2] stated problem of the compressed pattern matching in small extra space. They propose time space ecient pattern matching algorithm that works for run length encoding. Their algorithm (designed for 2d pattern matching) works in linear time and requires only linear space in the size of a compressed ....
....and then how to combine that with an on line ecient search. In section 4 we discuss an implementation of our algorithm as well as the results of several experiments. We conclude (section 5) with several remarks on the subject. 2 Preliminaries We start with some formal de nitions. Let s = s[1] s[2]; s[m] be a string over an alphabet with j j 2. We shall frequently denote s by s[1; m] An initial segment s[1; i] for i = 1; m, is called a pre x of string s, and nal segment s[j; m] is called a sux of s. A period of s is a positive integer q such that for any i, ....
A. Amir, G.M. Landau, and D. Sokol, Inplace Run-Length 2d Compressed Search, In Proceedings of 11th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'2000, San Francisco, pp. 817-818.
Inplace Run-Length 2D Compressed Search - Amir, Landau, Sokol (2000) (3 citations) Self-citation (Amir Landau Sokol) (Correct)
....to modify their algorithm so that its extra space is O(jP j) However, using the run length compression, the di erence between jP j and jcompressed(P )j can be quadratic. Moreover, the constants involved in the complexity of their algorithm are large, while our constants are relatively small. In [6] we presented an inplace algorithm for a similar problem. There, the de nition of a match was restricted in the sense that a pattern occurrence had to be sharp, i.e. it could not blend in with its surroundings. In this paper we solve the more general problem of nding every occurrence of the ....
A. Amir, G. Landau, and D. Sokol. Inplace run-length 2d compressed search. In Proc. 11th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 817-818, 2000. 22
Time/Space Ecient Compressed Pattern Matching - Leszek Asieniec Igor (Correct)
No context found.
A. Amir, G.M. Landau, and D. Sokol, Inplace Run-Length 2d Compressed Search, In Proceedings of 11th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'2000, San Francisco, pp. 817-818.
Real-Time Traversal in Grammar-Based Compressed Files - Gasieniec, Kolpakov.. (Correct)
No context found.
A. Amir, G.M. Landau, and D. Sokol, Inplace Run-Length 2d Compressed Search, In Proceedings of 11th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'2000, San Francisco, pp. 817--818.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC