Dynamic text and static pattern matching

DOI10.1145/1240233.1240242zbMath1321.68547OpenAlexW1991166425MaRDI QIDQ2944556

Gad M. Landau, Dina Sokol, Amihood Amir, Moshe Lewenstein

Publication date: 2 September 2015

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1240233.1240242

zbMATH Keywords

border treesdynamic textstatic pattern

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms on strings (68W32)

Related Items (18)

Order-preserving pattern matching with \(k\) mismatches ⋮ Upper and Lower Bounds for Dynamic Data Structures on Strings ⋮ Cross-document pattern matching ⋮ Finding top-\(k\) longest palindromes in substrings ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Dynamic and internal longest common substring ⋮ Longest Common Factor After One Edit Operation ⋮ Dynamic relative compression, dynamic partial sums, and substring concatenation ⋮ Cache-oblivious index for approximate string matching ⋮ Unnamed Item ⋮ Faster algorithms for 1-mappability of a sequence ⋮ Internal dictionary matching ⋮ Indexing weighted sequences: neat and efficient ⋮ Repetition Detection in a Dynamic String ⋮ Quasi-Linear-Time Algorithm for Longest Common Circular Factor ⋮ Orthogonal Range Searching for Text Indexing

This page was built for publication: Dynamic text and static pattern matching