Permuted function matching

DOI10.1016/J.IPL.2010.08.017MaRDI QIDQ1675783zbMATH OpenOpenAlexFDO

Authors Raphaël Clifford, Benjamin Sach

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)

Recommendations

• scientific article; zbMATH DE number 2038765
• Function Matching
• Algorithms – ESA 2004
• Permuted Pattern Matching on Multi-track Strings
• Permuted scaled matching

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2038765 (Why is no real title available?)
• A theory of parameterized pattern matching
• Alphabet dependence in parameterized matching
• Approximate parameterized matching
• Data streams: algorithms and applications.
• Faster algorithms for string matching with k mismatches
• On two class-constrained versions of the multiple knapsack problem
• Parameterized matching with mismatches
• Self-normalised Distance with Don’t Cares
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• Verifying candidate matches in sparse and wildcard matching

Cited in

(5)

• Function Matching
• Permutable functions
• scientific article; zbMATH DE number 2038765 (Why is no real title available?)
• New variants of pattern matching with constants and variables
• A brief history of parameterized matching problems

This page was built for publication: Permuted function matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1675783)