Verifying candidate matches in sparse and wildcard matching
From MaRDI portal
Publication:3579248
DOI10.1145/509907.509992zbMath1192.68819MaRDI QIDQ3579248
Richard John Cole, Ramesh Hariharan
Publication date: 5 August 2010
Published in: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/509907.509992
Related Items
Approximate pattern matching with the \(L_1\), \(L_2\) and \(L_\infty\) metrics, A black box for online approximate pattern matching, Simple deterministic wildcard matching, Pattern matching with don't cares and few errors, Finding submasses in weighted strings with fast Fourier transform, Incremental discovery of the irredundant motif bases for all suffixes of a string in \(O(n^2\log n)\)time, Matching with don't-cares and a small number of mismatches, Faster pattern matching with character classes using prime number encoding, Approximate string matching with address bit errors, String matching with up to \(k\) swaps and mismatches, Motif patterns in 2D, On minimizing pattern splitting in multi-track string matching, Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees, Approximate String Matching with Address Bit Errors, A Black Box for Online Approximate Pattern Matching, Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard
