A filtering technique for all pairs approximate parameterized string matching
From MaRDI portal
Publication:5114858
Recommendations
Cites work
- scientific article; zbMATH DE number 5725179 (Why is no real title available?)
- scientific article; zbMATH DE number 3240929 (Why is no real title available?)
- A decomposition theorem for maximum weight bipartite matchings
- A theory of parameterized pattern matching
- Algorithms For Computing Approximate Repetitions In Musical Sequences
- Algorithms on Strings
- Approximate parameterized matching
- Error detecting and error correcting codes
- Faster Scaling Algorithms for Network Problems
- Fibonacci heaps and their uses in improved network optimization algorithms
- Fine-tuning decomposition theorem for maximum weight bipartite matching
- Jewels of Stringology
- On Context-Free Languages
- Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
- Parameterized matching with mismatches
- Parameterized pattern matching: Algorithms and applications
- Parameterized searching with mismatches for run-length encoded strings
- Scaling algorithms for network problems
- The exact online string matching problem: a review of the most recent results
- Weighted approximate parameterized string matching
This page was built for publication: A filtering technique for all pairs approximate parameterized string matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5114858)