Pages that link to "Item:Q847263"
From MaRDI portal
The following pages link to Pattern matching with don't cares and few errors (Q847263):
Displaying 18 items.
- On pattern matching with \(k\) mismatches and few don't cares (Q344551) (← links)
- Matching with don't-cares and a small number of mismatches (Q976093) (← links)
- A filtering algorithm for \(k\)-mismatch with don't cares (Q1675785) (← links)
- Streaming pattern matching with \(d\) wildcards (Q1741859) (← links)
- Generalized framework for group testing: queries, feedbacks and adversaries (Q2136279) (← links)
- Low-weight superimposed codes and related combinatorial structures: bounds and applications (Q2285161) (← links)
- On the average-case complexity of pattern matching with wildcards (Q2672571) (← links)
- Approximate subset matching with don't cares (Q2768309) (← links)
- k-Mismatch with Don’t Cares (Q3527207) (← links)
- (Q3565933) (← links)
- Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard (Q3637111) (← links)
- Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams (Q5002743) (← links)
- The Negligible and Yet Subtle Cost of Pattern Matching (Q5056004) (← links)
- A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance (Q5240425) (← links)
- Functional and Logic Programming (Q5308027) (← links)
- Subquadratic non-adaptive threshold group testing (Q5919529) (← links)
- (Q6084356) (← links)
- Bounds and algorithms for generalized superimposed codes (Q6161430) (← links)
