Permuted function matching
From MaRDI portal
Publication:1675783
DOI10.1016/j.ipl.2010.08.017zbMath1379.68369OpenAlexW2076430677MaRDI QIDQ1675783
Benjamin Sach, Raphaël Clifford
Publication date: 3 November 2017
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2010.08.017
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Approximation algorithms (68W25) Algorithms on strings (68W32)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parameterized matching with mismatches
- Alphabet dependence in parameterized matching
- Self-normalised Distance with Don’t Cares
- Verifying candidate matches in sparse and wildcard matching
- Approximate parameterized matching
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Faster algorithms for string matching with k mismatches
- A theory of parameterized pattern matching
- On two class-constrained versions of the multiple knapsack problem