Set intersection and sequence matching with mismatch counting
From MaRDI portal
Recommendations
- Fast set intersection and two-patterns matching
- Fast set intersection and two-patterns matching
- Combinatorial Pattern Matching
- scientific article; zbMATH DE number 139916
- Fast algorithms for approximately counting mismatches
- scientific article; zbMATH DE number 2087043
- Matching among multiple random sequences
- Pattern matching for sets of segments
- Pattern matching for sets of segments
Cites work
- scientific article; zbMATH DE number 3471577 (Why is no real title available?)
- scientific article; zbMATH DE number 1305413 (Why is no real title available?)
- scientific article; zbMATH DE number 1445379 (Why is no real title available?)
- Approximate subset matching with don't cares
- Combinatorial Pattern Matching
- Combinatorial Pattern Matching
- Fast Pattern Matching in Strings
- From coding theory to efficient pattern matching
- On improving the worst case running time of the Boyer-Moore string matching algorithm
- Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics
- Simple deterministic wildcard matching
- Tree Pattern Matching to Subset Matching in Linear Time
- Verifying candidate matches in sparse and wildcard matching
Cited in
(3)
This page was built for publication: Set intersection and sequence matching with mismatch counting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294918)