Transposition invariant string matching
From MaRDI portal
Recommendations
Cited in
(15)- Rotation and lighting invariant template matching
- Practical algorithms for transposition-invariant string-matching
- Sequential and indexed two-dimensional combinatorial template matching allowing rotations
- String comparison by transposition networks
- New tabulation and sparse dynamic programming based techniques for sequence similarity problems
- FLEXIBLE MUSIC RETRIEVAL IN SUBLINEAR TIME
- EFFICIENT ALGORITHMS FOR (δ,γ,α) AND (δ, kΔ, α)-MATCHING
- Space-efficient data-analysis queries on grids
- New algorithms on wavelet trees and applications to information retrieval
- scientific article; zbMATH DE number 1962813 (Why is no real title available?)
- String Processing and Information Retrieval
- Longest common substring with gaps and related problems
- A new efficient algorithm for computing the longest common subsequence
- Speeding up transposition-invariant string matching
- Algorithms for computing variants of the longest common subsequence problem
This page was built for publication: Transposition invariant string matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5692274)