Generalized function matching

DOI10.1016/j.jda.2006.10.001zbMath1135.68059OpenAlexW2080175276MaRDI QIDQ2466014

Igor Nor, Amihood Amir

Publication date: 11 January 2008

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2006.10.001

zbMATH Keywords

NP-hardpattern matchingparameterized matchingfunction matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

A parameterized study of maximum generalized pattern matching problems, On the parameterised complexity of string morphism problems, Matching patterns with variables under edit distance, Order-preserving matching, A note on the complexity of matching patterns with variables, Patterns with bounded treewidth, Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams, Detecting One-Variable Patterns, A prefix array for parameterized strings, Unnamed Item, A brief history of parameterized matching problems, Unnamed Item, Unnamed Item, Pattern matching with variables: a multivariate complexity analysis, Order-preserving pattern matching indeterminate strings

Cites Work

• Efficient 2-dimensional approximate matching of half-rectangular figures
• A fast string searching algorithm
• Optimal parallel pattern matching in strings
• Generalized String Matching
• Fast Pattern Matching in Strings
• An Alphabet Independent Approach to Two-Dimensional Pattern Matching
• Pattern Matching with Swaps
• A theory of parameterized pattern matching
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item