Order-preserving pattern matching with \(k\) mismatches

DOI10.1016/j.tcs.2015.08.022zbMath1344.68313arXiv1309.6453OpenAlexW2105550931MaRDI QIDQ294955

Paweł Gawrychowski, Przemysław Uznański

Publication date: 16 June 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

approximate pattern matchingorder-preserving pattern matching

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items (5)

String Periods in the Order-Preserving Model ⋮ Order-preserving pattern matching with scaling ⋮ String periods in the order-preserving model ⋮ Circular pattern matching with \(k\) mismatches ⋮ An Encoding for Order-Preserving Matching.

Cites Work

• Unnamed Item
• Pattern matching for permutations
• A linear time algorithm for consecutive permutation pattern matching
• Order-preserving matching
• Fast Order-Preserving Pattern Matching
• Single and Multiple Consecutive Permutation Motif Search
• Dynamic text and static pattern matching
• Linear work suffix array construction
• Deterministic sorting in O ( n log log n ) time and linear space
• Approximate parameterized matching
• A fast algorithm for computing longest common subsequences

This page was built for publication: Order-preserving pattern matching with \(k\) mismatches