Searching 2D-strings for matching frames

DOI10.4230/LIPICS.CPM.2024.10MaRDI QIDQ6891087zbMATH OpenFDO

Authors Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus, Adrian Miclăuş, Arseny M. Shur

Publication date 2 December 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.CPM.2024.10

zbMATH Keywords

2D stringLCPmatching framemultidimensional range query

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cites work

• A Functional Approach to Data Structures and Its Use in Multidimensional Searching
• A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
• Approximate circular pattern matching
• Fast Algorithms for Finding Nearest Common Ancestors
• Fast Pattern Matching in Strings
• scientific article; zbMATH DE number 432779 (Why is no real title available?)
• scientific article; zbMATH DE number 2038766 (Why is no real title available?)
• scientific article; zbMATH DE number 742992 (Why is no real title available?)
• scientific article; zbMATH DE number 7559452 (Why is no real title available?)
• scientific article; zbMATH DE number 7651193 (Why is no real title available?)
• Linear Time Suffix Array Construction Using D-Critical Substrings
• Linear-time construction of suffix arrays (extended abstract)
• Lower bounds for the number of repetitions in 2D strings
• New Data Structures for Orthogonal Range Queries
• On-line construction of suffix trees
• Optimal square detection over general alphabets
• Palindromic length in linear time
• Periodicity in rectangular arrays
• Range predecessor and Lempel-Ziv parsing
• Repetition Detection in a Dynamic String
• Searching runs in streams
• Simple deterministic wildcard matching
• Space efficient linear time construction of suffix arrays
• The ``runs theorem
• The number of repetitions in 2D-strings
• The program-size complexity of self-assembled squares (extended abstract)
• The undecidability of the domino problem
• Tight tradeoffs for real-time approximation of longest palindromes in streams
• Two hands are better than one (up to constant factors): self-assembly in the 2HAM vs. aTAM
• Two-dimensional maximal repetitions
• Two-dimensional palindromes and their properties
• Two-Dimensional Periodicity in Rectangular Arrays
• Uniqueness Theorems for Periodic Functions

This page was built for publication: Searching 2D-strings for matching frames

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