A filtering technique for all pairs approximate parameterized string matching
From MaRDI portal
Publication:5114858
DOI10.1007/978-981-13-0023-3_10zbMATH Open1455.68292OpenAlexW2796862673MaRDI QIDQ5114858FDOQ5114858
Authors: Shibsankar Das 
Publication date: 29 June 2020
Published in: Communications in Computer and Information Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-981-13-0023-3_10
Recommendations
Hamming distanceParikh vector\( \gamma (k)\)-match of vectorsapproximate parameterized string matchingPV-filtering technique
Cites Work
- Fibonacci heaps and their uses in improved network optimization algorithms
- Error Detecting and Error Correcting Codes
- Scaling algorithms for network problems
- Faster Scaling Algorithms for Network Problems
- Title not available (Why is that?)
- On Context-Free Languages
- Jewels of Stringology
- Parameterized pattern matching: Algorithms and applications
- Title not available (Why is that?)
- Approximate parameterized matching
- Algorithms on Strings
- The exact online string matching problem: a review of the most recent results
- A theory of parameterized pattern matching
- Parameterized searching with mismatches for run-length encoded strings
- Parameterized matching with mismatches
- A decomposition theorem for maximum weight bipartite matchings
- Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
- Algorithms For Computing Approximate Repetitions In Musical Sequences
- Weighted approximate parameterized string matching
- Fine-Tuning Decomposition Theorem for Maximum Weight Bipartite Matching
Cited In (1)
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)
