Parameterized searching with mismatches for run-length encoded strings
From MaRDI portal
(Redirected from Publication:714802)
Recommendations
Cites work
- scientific article; zbMATH DE number 1302174 (Why is no real title available?)
- Alphabet dependence in parameterized matching
- Approximate parameterized matching
- Fibonacci heaps and their uses in improved network optimization algorithms
- Network flows. Theory, algorithms, and applications.
- Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
- Parameterized matching with mismatches
- Parameterized pattern matching: Algorithms and applications
Cited in
(9)- The structural border array
- Parameterized matching with mismatches
- A filtering technique for all pairs approximate parameterized string matching
- Weighted approximate parameterized string matching
- An Opportunistic Text Indexing Structure Based on Run Length Encoding
- Compressed parameterized pattern matching
- A brief history of parameterized matching problems
- A prefix array for parameterized strings
- Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard
This page was built for publication: Parameterized searching with mismatches for run-length encoded strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714802)