Inplace run-length 2d compressed search

Authors:
Amihood Amir;Gad M. Landau;Dina Sokol
Affiliations:
Department of Mathematics and Computer Science, Bar-Ilan University, 52900 Ramat-Gan, Israel and College of Computing, Georgia Tech;Department of Computer Science, Haifa University, Haifa 31905, Israel and Department of Computer and Information Science, Polytechnic University;Department of Mathematics and Computer Science, Bar-Ilan University, 52900 Ramat-Gan, Israel
Venue:
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Year:
2000

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
Optimal two-dimensional compressed matching

Journal of Algorithms
Alphabet Independent and Dictionary Scaled Matching

CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach (Extended Abstract)

CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching

Time/Space Efficient Compressed Pattern Matching

FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Inplace run-length 2d compressed search

Theoretical Computer Science
Time/space efficient compressed pattern matching

Fundamenta Informaticae - Special issue on computing patterns in strings
The SBC-tree: an index for run-length compressed sequences

EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Time/Space Efficient Compressed Pattern Matching

Fundamenta Informaticae - Computing Patterns in Strings

Hi-index	0.00