Permuted function matching

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

zbMATH Keywords

approximation algorithmstheory of computationapproximate pattern matchingmultiple knapsack problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Approximation algorithms (68W25) Algorithms on strings (68W32)

Related Items (1)

A brief history of parameterized matching problems

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Permuted function matching