Internal dictionary matching
type: Item
instance of: scholarly article
title: Internal dictionary matching
author: Panagiotis Charalampopoulos
author: Tomasz Kociumaka
author: Manal Mohamed
author: Jakub Radoszewski
author: Wojciech Rytter
author: Tomasz Waleń
published in: Algorithmica
publication date: 2021-06-30T00:00:00Z
full work available at URL: https://arxiv.org/abs/1909.11577
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2019/11518/
Mathematics Subject Classification ID: 68Wxx
Mathematics Subject Classification ID: 05Cxx
zbMATH DE Number: 7365273
zbMATH Keywords: dictionary matching
zbMATH Keywords: internal pattern matching
zbMATH Keywords: range searching
zbMATH Keywords: dynamic dictionary
MaRDI profile type: Publication
OpenAlex ID: W2991483459
cites work: Efficient string matching
cites work: Dynamic dictionary matching
cites work: Improved dynamic dictionary matching
cites work: Dynamic text and static pattern matching
cites work: Wavelet Trees Meet Suffix Trees
cites work: The “Runs” Theorem
cites work: Q5110887
cites work: The level ancestor problem simplified
cites work: Lowest common ancestors in trees and directed acyclic graphs
cites work: Multidimensional divide-and-conquer
cites work: Dynamic dictionary matching and compressed suffix trees
cites work: Q5417615
cites work: Q5874434
cites work: Q5875583
cites work: Dictionary matching and indexing with errors and don't cares
cites work: Algorithms on Strings
cites work: Extracting powers and periods in a word from its runs structure
cites work: On the sorting-complexity of suffix tree construction
cites work: Uniqueness Theorems for Periodic Functions
cites work: Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
cites work: The nearest colored node in a tree
cites work: Counting distinct palindromes in a word in linear time
cites work: Fast Algorithms for Finding Nearest Common Ancestors
cites work: Space efficient data structures for dynamic orthogonal range counting
cites work: Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture
cites work: Faster Fully Compressed Pattern Matching by Recompression
cites work: Recompression
cites work: Generalized substring compression
cites work: A Linear-Time Algorithm for Seeds Computation
cites work: Internal Pattern Matching Queries in a Text and Applications
cites work: Rank and select revisited and extended
cites work: Fast construction of wavelet trees
cites work: Q4828998
cites work: Unifying the Landscape of Cell-Probe Lower Bounds
cites work: Counting Palindromes in Substrings
cites work: Longest Common Extensions with Recompression.
DOI: 10.1007/S00453-021-00821-Y
description: scientific article; zbMATH DE number 7365273