Document Open Access Logo

Better Indexing for Rectangular Pattern Matching

Authors Paweł Gawrychowski , Adam Górkiewicz

PDF

File

Thumbnail PDF
PDF
LIPIcs.ESA.2025.33.pdf
  • Filesize: 0.56 MB
  • 7 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Design and analysis of algorithms
  • Theory of computation → Pattern matching
Keywords
  • 2D strings
  • pattern matching
  • string indexing

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

We revisit the complexity of building, given a two-dimensional string of size n, an indexing structure that allows locating all k occurrences of a two-dimensional pattern of size m. While a structure of size 𝒪(n) with query time 𝒪(m+k) is known for this problem under the additional assumption that the pattern is a square [Giancarlo, SICOMP 1995], a popular belief was that for rectangular patterns one cannot achieve such (or even similar) bounds, due to a lower bound for a certain natural class of approaches [Giancarlo, WADS 1993]. We show that, in fact, it is possible to construct a very simple structure of size 𝒪(nlog n) that supports such queries for any rectangular pattern in 𝒪(m+klog^{ε}n) time, for any ε > 0.

Cite As Get BibTex

Paweł Gawrychowski and Adam Górkiewicz. Better Indexing for Rectangular Pattern Matching. In 33rd Annual European Symposium on Algorithms (ESA 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 351, pp. 33:1-33:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ESA.2025.33

Author Details

Paweł Gawrychowski
  • Institute of Computer Science, University of Wrocław, Poland
Adam Górkiewicz
  • Institute of Computer Science, University of Wrocław, Poland

Funding

Partially supported by the Polish National Science Centre grant number 2023/51/B/ST6/ 01505.

Acknowledgements

We would like to thank Itai Boneh and Panagiotis Charalampopoulos for participating in the initial discussion.

References

  1. Amihood Amir, Gary Benson, and Martin Farach. An alphabet independent approach to two-dimensional pattern matching. SIAM J. Comput., 23(2):313-323, 1994. URL: https://doi.org/10.1137/S0097539792226321.
  2. Amihood Amir and Martin Farach. Two-dimensional dictionary matching. Inf. Process. Lett., 44(5):233-239, 1992. URL: https://doi.org/10.1016/0020-0190(92)90206-B.
  3. Lorraine A. K. Ayad, Grigorios Loukides, and Solon P. Pissis. Text indexing for long patterns: Anchors are all you need. Proc. VLDB Endow., 16(9):2117-2131, 2023. URL: https://doi.org/10.14778/3598581.3598586.
  4. Theodore P. Baker. A technique for extending rapid exact-match string matching to arrays of more than one dimension. SIAM J. Comput., 7(4):533-541, 1978. URL: https://doi.org/10.1137/0207043.
  5. Richard S. Bird. Two dimensional pattern matching. Information Processing Letters, 6(5):168-170, 1977. URL: https://doi.org/10.1016/0020-0190(77)90017-5.
  6. Timothy M. Chan, Kasper Green Larsen, and Mihai Pătraşcu. Orthogonal range searching on the RAM, revisited. In SCG, pages 1-10. ACM, 2011. URL: https://doi.org/10.1145/1998196.1998198.
  7. Ying Choi and Tak Wah Lam. Dynamic suffix tree and two-dimensional texts management. Inf. Process. Lett., 61(4):213-220, 1997. URL: https://doi.org/10.1016/S0020-0190(97)00018-5.
  8. Michael L. Fredman, János Komlós, and Endre Szemerédi. Storing a sparse table with O(1) worst case access time. J. ACM, 31(3):538-544, 1984. URL: https://doi.org/10.1145/828.1884.
  9. Kimmo Fredriksson, Gonzalo Navarro, and Esko Ukkonen. An index for two dimensional string matching allowing rotations. In IFIP TCS, volume 1872 of Lecture Notes in Computer Science, pages 59-75. Springer, 2000. URL: https://doi.org/10.1007/3-540-44929-9_5.
  10. Zvi Galil and Kunsoo Park. Alphabet-independent two-dimensional witness computation. SIAM J. Comput., 25(5):907-935, 1996. URL: https://doi.org/10.1137/S0097539792241941.
  11. Raffaele Giancarlo. An index data structure for matrices, with applications to fast two-dimensional pattern matching. In WADS, volume 709 of Lecture Notes in Computer Science, pages 337-348. Springer, 1993. URL: https://doi.org/10.1007/3-540-57155-8_260.
  12. Raffaele Giancarlo. A generalization of the suffix tree to square matrices, with applications. SIAM J. Comput., 24(3):520-562, 1995. URL: https://doi.org/10.1137/S0097539792231982.
  13. Raffaele Giancarlo and Roberto Grossi. Parallel construction and query of suffix trees for two-dimensional matrices. In SPAA, pages 86-97. ACM, 1993. URL: https://doi.org/10.1145/165231.165243.
  14. Raffaele Giancarlo and Roberto Grossi. On the construction of classes of suffix trees for square matrices: Algorithms and applications. In ICALP, volume 944 of Lecture Notes in Computer Science, pages 111-122. Springer, 1995. URL: https://doi.org/10.1007/3-540-60084-1_67.
  15. Raffaele Giancarlo and Roberto Grossi. Parallel construction and query of index data structures for pattern matching on square matrices. J. Complex., 15(1):30-71, 1999. URL: https://doi.org/10.1006/JCOM.1998.0496.
  16. Raffaele Giancarlo and Daniela Guaiana. On-line construction of two-dimensional suffix trees. J. Complex., 15(1):72-127, 1999. URL: https://doi.org/10.1006/JCOM.1998.0495.
  17. Richard M. Karp, Raymond E. Miller, and Arnold L. Rosenberg. Rapid identification of repeated patterns in strings, trees and arrays. In STOC, pages 125-136. ACM, 1972. URL: https://doi.org/10.1145/800152.804905.
  18. Dong Kyue Kim, Joong Chae Na, Jeong Seop Sim, and Kunsoo Park. Linear-time construction of two-dimensional suffix trees. Algorithmica, 59(2):269-297, 2011. URL: https://doi.org/10.1007/S00453-009-9350-Z.
  19. Moshe Lewenstein. Orthogonal range searching for text indexing. In Space-Efficient Data Structures, Streams, and Algorithms, volume 8066 of Lecture Notes in Computer Science, pages 267-302. Springer, 2013. URL: https://doi.org/10.1007/978-3-642-40273-9_18.
  20. Udi Manber and Eugene W. Myers. Suffix arrays: A new method for on-line string searches. SIAM J. Comput., 22(5):935-948, 1993. URL: https://doi.org/10.1137/0222058.
  21. Joong Chae Na, Raffaele Giancarlo, and Kunsoo Park. On-line construction of two-dimensional suffix trees in O(n²log n) time. Algorithmica, 48(2):173-186, 2007. URL: https://doi.org/10.1007/S00453-007-0063-X.
  22. Peter Weiner. Linear pattern matching algorithms. In SWAT, pages 1-11. IEEE Computer Society, 1973. URL: https://doi.org/10.1109/SWAT.1973.13.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact