• Home
  • Search
  • 2-Dimensional String Problems: Data Structures and Quantum Algorithms
  • https://doi.org/10.31390/gradschool_theses.5642Copy DOI Icon

2-Dimensional String Problems: Data Structures and Quantum Algorithms

  • Jul 1, 2022
  • Dhrumilkumar Patel
Show More
  • Abstract
  • Literature Map
  • References
  • Similar Papers
Abstract

The field of stringology studies algorithms and data structures used for processing strings efficiently. The goal of this thesis is to investigate 2-dimensional (2D) variants of some fundamental string problems, including \textit{Exact Pattern Matching} and \textit{Longest Common Substring}. In the 2D pattern matching problem, we are given a matrix $\M[1\dd n,1\dd n]$ that consists of $N = n \times n$ symbols drawn from an alphabet $\Sigma$ of size $\sigma$. The query consists of a $ m \times m$ square matrix $\PP[1\dd m, 1\dd m]$ drawn from the same alphabet, and the task is to find all the locations of $\PP$ in $\M$. For such square patterns, data structures such as suffix trees and suffix arrays exist for the task of efficient pattern matching. However, a suffix tree occupies $O(N \log N)$ bits, which is significantly more than that of the original text's size of $N\log \sigma$ bits. Therefore, the design of compressed data structures, that supports pattern matching queries efficiently and occupies space close to the original text's size, is imperative. In this thesis, we show an interesting result by designing a compact text index of size $O(N \log\log N + N \log\sigma)$ bits that at least supports efficient inverse suffix array queries. Although, the question of designing a compressed text index that would lead to efficient pattern matching is still evasive, this index gives a hope on the existence of a full 2D compressed text index with all functionalities similar to that of 1D case. On the other hand, the Longest Common 2D substring problem consists of two 2D strings (matrices), and the task is to report the size of the longest common 2D substring (submatrix) of these 2D strings. It is interesting to know if there exists a sublinear-time algorithm for solving this task. We answer this question positively by presenting a sublinear-time \textit{quantum} algorithm. In addition to this, we prove that any quantum algorithm requires at least $\tilde{\Omega}(N^{2/3})$ time to solve this problem.

Similar Papers
  • Supplementary Content
  • Citations1

Inverse Suffix Array Queries for 2-Dimensional Pattern Matching in Near-Compact Space

  • Jan 01, 2021
  • DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
  • Dhrumil Patel +1
  • PDF
  • Research Article
  • Citations3

Solving String Problems on Graphs Using the Labeled Direct Product

  • Jul 05, 2022
  • Algorithmica
  • Nicola Rizzo +2
  • Research Article
  • Citations2

Quantum Speed-Ups for String Synchronizing Sets, Longest Common Substring, and k -mismatch Matching

  • Aug 05, 2024
  • ACM Transactions on Algorithms
  • Ce Jin +1
  • Conference Article
  • Citations3

A parallel LCS algorithm for biosequences alignment

  • Jun 06, 2007
  • Wei Liu +2
  • Conference Article
  • Citations101

Space-Efficient Framework for Top-k String Retrieval Problems

  • Oct 01, 2009
  • Wing-Kai Hon +2
  • Conference Article
  • Citations14

I/O-Efficient Compressed Text Indexes: From Theory to Practice

  • Jan 01, 2010
  • Sheng-Yuan Chiu +3
  • Conference Article
  • Citations58

String Matching in Hardware Using the FM-Index

  • May 01, 2011
  • Edward Fernandez +2
  • Conference Article
  • Citations42

Parallel suffix array and least common prefix for the GPU

  • Feb 23, 2013
  • Mrinal Deo +1
  • Research Article

Adaptive Non-Linear Pattern Matching Automata

  • Aug 18, 2020
  • TU/e Research Portal
  • Rick Erkens +1
  • Research Article
  • Citations17

Finding Range Minima in the Middle: Approximations and Applications

  • Nov 27, 2009
  • Mathematics in Computer Science
  • Johannes Fischer +1
  • PDF
  • Research Article
  • Citations1

Adaptive Non-linear Pattern Matching Automata

  • Dec 17, 2021
  • Logical Methods in Computer Science
  • Rick Erkens +1
  • Conference Article
  • Citations5

Sequence learning using the adaptive suffix trie algorithm

  • Jun 01, 2012
  • Upuli Gunasinghe +1
  • Research Article
  • Citations4

Counting complex disordered states by efficient pattern matching: chromatic polynomials and Potts partition functions

  • Feb 01, 2009
  • New Journal of Physics
  • Marc Timme +3
  • Conference Article

Scalable Structural Similarity Analysis of JSON documents Using MapReduce

  • Jul 06, 2025
  • Achraf Drissi +2
  • Conference Article
  • Citations2

Pattern matching with wildcards based on multiple suffix trees

  • Aug 01, 2012
  • Yingling Liu +4
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.