Parameterized matching on non-linear structures

DOI10.1016/j.ipl.2009.04.012zbMath1209.68167OpenAlexW2021961848MaRDI QIDQ989510

Amihood Amir, Gonzalo Navarro

Publication date: 20 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.04.012

zbMATH Keywords

algorithmsNP-completenessparameterized matchingpattern matching in trees and dags

Mathematics Subject Classification ID

Searching and sorting (68P10) Pattern recognition, speech recognition (68T10)

Related Items (4)

On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling ⋮ Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams ⋮ Order Preserving Pattern Matching on Trees and DAGs ⋮ A brief history of parameterized matching problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multiple matching of parameterized patterns
• Parameterized matching with mismatches
• Alphabet dependence in parameterized matching
• Improved approximate pattern matching on hypertext
• Parameterized pattern matching: Algorithms and applications
• Fast Pattern Matching in Strings
• An Alphabet Independent Approach to Two-Dimensional Pattern Matching
• Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
• Pattern Matching in Hypertext
• Algorithms – ESA 2004
• Function Matching

This page was built for publication: Parameterized matching on non-linear structures