scientific article; zbMATH DE number 7051247
From MaRDI portal
Publication:4633890
zbMath1421.68255MaRDI QIDQ4633890
Klim Efremenko, Raphaël Clifford, Amir Rothschild, Ely Porat
Publication date: 6 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=1496855
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (16)
Set intersection and sequence matching with mismatch counting ⋮ On pattern matching with \(k\) mismatches and few don't cares ⋮ On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling ⋮ Mismatch sampling ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Approximate pattern matching with \(k\)-mismatches in packed text ⋮ A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance ⋮ On string matching with mismatches ⋮ Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams ⋮ Streaming pattern matching with \(d\) wildcards ⋮ Periodicity in data streams with wildcards ⋮ Hardness of comparing two run-length encoded strings ⋮ Verifiable Stream Computation and Arthur--Merlin Communication ⋮ A faster algorithm for the computation of string convolutions using LZ78 parsing ⋮ Efficient sampling of non-strict turnstile data streams
This page was built for publication:
