2026-08-10T11:57:52Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6073 2024-03-06T10:37:33Z ddc:004 open_access

Space-Efficient Dictionaries for Parameterized and Order-Preserving Pattern Matching Ganguly, Arnab Hon, Wing-Kai Sadakane, Kunihiko Shah, Rahul Thankachan, Sharma V. Yang, Yilin Parameterized Matching Order-preserving Matching Dictionary Indexing Aho-Corasick Automaton Sparsification Let S and S' be two strings of the same length.We consider the following two variants of string matching. * Parameterized Matching: The characters of S and S' are partitioned into static characters and parameterized characters. The strings are parameterized match iff the static characters match exactly and there exists a one-to-one function which renames the parameterized characters in S to those in S'. * Order-Preserving Matching: The strings are order-preserving match iff for any two integers i,j in [1,|S|], S[i] <= S[j] iff S'[i] <= S'[j]. Let P be a collection of d patterns {P_1, P_2, ..., P_d} of total length n characters, which are chosen from an alphabet Sigma. Given a text T, also over Sigma, we consider the dictionary indexing problem under the above definitions of string matching. Specifically, the task is to index P, such that we can report all positions j where at least one of the patterns P_i in P is a parameterized-match (resp. order-preserving match) with the same-length substring of $T$ starting at j. Previous best-known indexes occupy O(n * log(n)) bits and can report all occ positions in O(|T| * log(|Sigma|) + occ) time. We present space-efficient indexes that occupy O(n * log(|Sigma|+d) * log(n)) bits and reports all occ positions in O(|T| * (log(|Sigma|) + log_{|Sigma|}(n)) + occ) time for parameterized matching and in O(|T| * log(n) + occ) time for order-preserving matching. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Arnab Ganguly and Wing-Kai Hon and Kunihiko Sadakane and Rahul Shah and Sharma V. Thankachan and Yilin Yang 2016 Is Part Of LIPIcs, Volume 54, 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CPM.2016.2 urn:nbn:de:0030-drops-60736 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2016.2 eng https://creativecommons.org/licenses/by/3.0/legalcode