Order Preserving Pattern Matching on Trees and DAGs

DOI10.1007/978-3-319-67428-5_23zbMath1454.68207arXiv1706.00148OpenAlexW2621264256MaRDI QIDQ5150939

Shunsuke Inenaga, Hideo Bannai, Temma Nakamura, Masayuki Takeda

Publication date: 16 February 2021

Published in: String Processing and Information Retrieval (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1706.00148

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms on strings (68W32)

Related Items

A brief history of parameterized matching problems

Cites Work

• A linear time algorithm for consecutive permutation pattern matching
• A fast algorithm for order-preserving pattern matching
• A filtration method for order-preserving matching
• Parameterized matching on non-linear structures
• Order-preserving matching
• Searching subsequences
• Efficient Algorithms for the Order Preserving Pattern Matching Problem
• Faster tree pattern matching
• Pattern matching for permutations
• Pattern matching in hypertext
• Hypertext Searching - A Survey
• String matching algorithms and automata