Pattern matching with swaps in practice
From MaRDI portal
Recommendations
- Pattern Matching with Swaps
- Efficient special cases of pattern matching with swaps
- A new algorithm for efficient pattern matching with swaps
- Pattern Matching with Swaps for Short Patterns in Linear Time
- Computational and Information Science
- String matching with up to k swaps and mismatches
- Pattern matching for permutations
- Pattern matching for permutations
- Approximate String Matching with Swap and Mismatch
Cites work
Cited in
(11)- Approximate swapped matching.
- Swap and mismatch edit distance
- Efficient special cases of pattern matching with swaps
- The swap matching problem revisited
- Pattern Matching with Swaps for Short Patterns in Linear Time
- A new algorithm for efficient pattern matching with swaps
- scientific article; zbMATH DE number 2080211 (Why is no real title available?)
- Pattern Matching with Swaps
- A simple streaming bit-parallel algorithm for swap pattern matching
- Algorithms – ESA 2004
- On the complexity of indeterminate strings matching
This page was built for publication: Pattern matching with swaps in practice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2909198)