An algorithm for string matching with a sequence of don't cares
From MaRDI portal
Publication:750152
DOI10.1016/0020-0190(91)90032-DzbMATH Open0713.68026OpenAlexW2053767428MaRDI QIDQ750152FDOQ750152
Authors: Udi Manber, Ricardo Baeza-Yates
Publication date: 1991
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(91)90032-d
Recommendations
Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)
Cites Work
Cited In (14)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A matching algorithm in PMWL based on CluTree
- A unified view to string matching algorithms
- A faster algorithm for matching a set of patterns with variable length don't cares
- Online algorithms for finding distinct substrings with length and multiple prefix and suffix conditions
- Title not available (Why is that?)
- Matching a set of strings with variable length don't cares
- Self-normalised Distance with Don’t Cares
- A fast algorithm for the generalizedk-keyword proximity problem given keyword offsets
- Window-accumulated subsequence matching problem is linear
- Multiple serial episodes matching
- On the string matching with \(k\) mismatches
- Title not available (Why is that?)
This page was built for publication: An algorithm for string matching with a sequence of don't cares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q750152)