Efficient special cases of pattern matching with swaps
From MaRDI portal
(Redirected from Publication:293429)
Recommendations
Cites work
- scientific article; zbMATH DE number 3949728 (Why is no real title available?)
- scientific article; zbMATH DE number 3471577 (Why is no real title available?)
- scientific article; zbMATH DE number 3551946 (Why is no real title available?)
- scientific article; zbMATH DE number 3240929 (Why is no real title available?)
- A fast string searching algorithm
- An Extension of the String-to-String Correction Problem
- Efficient 2-dimensional approximate matching of half-rectangular figures
- Fast Pattern Matching in Strings
- Generalized String Matching
- Pattern matching in compressed texts
- String matching under a general matching relation
- Two recognizable string-matching problems over free partially commutative monoids
Cited in
(14)- Pattern matching with pair correlation distance
- scientific article; zbMATH DE number 5717259 (Why is no real title available?)
- Pattern Matching with Swaps for Short Patterns in Linear Time
- On the hardness of optimal vertex relabeling and restricted vertex relabeling
- Pattern matching with swaps in practice
- Pattern Matching with Swaps
- Property matching and weighted matching
- Efficient Algorithms for the Spoonerism Problem
- The swap matching problem revisited
- A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns
- Restricted and swap common superstring: a multivariate algorithmic perspective
- scientific article; zbMATH DE number 2080211 (Why is no real title available?)
- Overlap matching.
- Approximate swapped matching.
This page was built for publication: Efficient special cases of pattern matching with swaps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293429)