Efficient Algorithms for the Order Preserving Pattern Matching Problem

DOI10.1007/978-3-319-41168-2_16zbMath1476.68314arXiv1501.04001OpenAlexW1776524573MaRDI QIDQ2830069

Simone Faro, M. Oğuzhan Külekci

Publication date: 9 November 2016

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

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

zbMATH Keywords

filtering algorithmstext processingexperimental algorithmsapproximate text analysis

Mathematics Subject Classification ID

Computing methodologies for text processing; mathematical typography (68U15) Algorithms on strings (68W32)

Related Items

Order-preserving indexing, String Periods in the Order-Preserving Model, Order Preserving Pattern Matching on Trees and DAGs, String periods in the order-preserving model, The order-preserving pattern matching problem in practice, Efficient Algorithms for the Order Preserving Pattern Matching Problem, An Encoding for Order-Preserving Matching.

Cites Work

• A linear time algorithm for consecutive permutation pattern matching
• A filtration method for order-preserving matching
• Order-preserving matching
• Efficient Algorithms for the Order Preserving Pattern Matching Problem
• Fast Order-Preserving Pattern Matching
• Single and Multiple Consecutive Permutation Motif Search
• A fast string searching algorithm
• Fast Pattern Matching in Strings