An algorithm for string matching with a sequence of don't cares
From MaRDI portal
Publication:750152
Recommendations
Cites work
- scientific article; zbMATH DE number 432779 (Why is no real title available?)
- scientific article; zbMATH DE number 3949728 (Why is no real title available?)
- scientific article; zbMATH DE number 140453 (Why is no real title available?)
- scientific article; zbMATH DE number 3471577 (Why is no real title available?)
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- Generalized String Matching
Cited in
(14)- Online algorithms for finding distinct substrings with length and multiple prefix and suffix conditions
- scientific article; zbMATH DE number 3949728 (Why is no real title available?)
- Multiple serial episodes matching
- On the string matching with \(k\) mismatches
- scientific article; zbMATH DE number 2119723 (Why is no real title available?)
- Matching a set of strings with variable length don't cares
- Self-normalised Distance with Don’t Cares
- scientific article; zbMATH DE number 2052918 (Why is no real title available?)
- scientific article; zbMATH DE number 5717259 (Why is no real title available?)
- A matching algorithm in PMWL based on CluTree
- A fast algorithm for the generalizedk-keyword proximity problem given keyword offsets
- Window-accumulated subsequence matching problem is linear
- A unified view to string matching algorithms
- A faster algorithm for matching a set of patterns with variable length don't cares
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)