String matching under a general matching relation
From MaRDI portal
Publication:1900318
DOI10.1006/inco.1995.1144zbMath0834.68094OpenAlexW2067545631MaRDI QIDQ1900318
Publication date: 18 March 1996
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1995.1144
Related Items (11)
Efficient special cases of pattern matching with swaps ⋮ Space lower bounds for online pattern matching ⋮ Overlap matching. ⋮ Towards optimal packed string matching ⋮ Pattern matching with address errors: rearrangement distances ⋮ Streaming pattern matching with \(d\) wildcards ⋮ Space Lower Bounds for Online Pattern Matching ⋮ Approximate pattern matching with the \(L_1\), \(L_2\) and \(L_\infty\) metrics ⋮ Periodicity in data streams with wildcards ⋮ Ternary Square-Free Partial Words with Many Wildcards ⋮ Approximate swapped matching.
This page was built for publication: String matching under a general matching relation
