Optimal Two-Dimensional Compressed Matching

DOI10.1006/JAGM.1997.0860MaRDI QIDQ4360137zbMATH OpenOpenAlexFDO

Authors Amihood Amir, Martin Farach, G. Benson

Publication date 20 October 1997

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1997.0860

zbMATH Keywords

compressed matching paradigm

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Optimal two-dimensional compressed matching
• scientific article; zbMATH DE number 742992
• Inplace run-length 2d compressed search.
• Inplace 2D matching in compressed images

Cited in

(11)

• Optimal parallel two dimensional text searching on a CREW PRAM
• Inplace run-length 2d compressed search.
• On the complexity of pattern matching for highly compressed two-dimensional texts.
• Collage system: A unifying framework for compressed pattern matching.
• Small-Space 2D Compressed Dictionary Matching
• Optimal two-dimensional compressed matching
• scientific article; zbMATH DE number 742992 (Why is no real title available?)
• scientific article; zbMATH DE number 1445382 (Why is no real title available?)
• Optimal bounds for distinct quartics
• Compressed dictionary matching on run-length encoded strings
• Compressed dictionary matching on run-length encoded strings

This page was built for publication: Optimal Two-Dimensional Compressed Matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4360137)