A Filtering Technique for All Pairs Approximate Parameterized String Matching

DOI10.1007/978-981-13-0023-3_10zbMath1455.68292OpenAlexW2796862673MaRDI QIDQ5114858

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

zbMATH Keywords

Hamming distanceParikh vector\( \gamma (k)\)-match of vectorsapproximate parameterized string matchingPV-filtering technique

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• Unnamed Item
• Parameterized searching with mismatches for run-length encoded strings
• Parameterized matching with mismatches
• Scaling algorithms for network problems
• Parameterized pattern matching: Algorithms and applications
• Weighted approximate parameterized string matching
• A Decomposition Theorem for Maximum Weight Bipartite Matchings
• The exact online string matching problem
• Approximate parameterized matching
• Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
• Jewels of Stringology
• Error Detecting and Error Correcting Codes
• Faster Scaling Algorithms for Network Problems
• Algorithms For Computing Approximate Repetitions In Musical Sequences
• Fibonacci heaps and their uses in improved network optimization algorithms
• A theory of parameterized pattern matching
• Fine-Tuning Decomposition Theorem for Maximum Weight Bipartite Matching
• Algorithms on Strings
• On Context-Free Languages

This page was built for publication: A Filtering Technique for All Pairs Approximate Parameterized String Matching