scholarly journals Faster Exponential Algorithm for Permutation Pattern Matching

2022 ◽  
pp. 279-284
Author(s):  
Paweł Gawrychowski ◽  
Mateusz Rzepecki
Keyword(s):  
Pattern Matching ◽  
Permutation Pattern

Parallel Algorithms for the Boxed-Mesh Permutation Pattern Matching Problem

2019 ◽  
Vol 46 (4) ◽  
pp. 299-307
Author(s):  
Jihyo Choi ◽  
Youngho Kim ◽  
Joong Chae Na ◽  
Jeong Seop Sim
Keyword(s):  
Parallel Algorithms ◽  
Pattern Matching ◽  
Matching Problem ◽  
Permutation Pattern

scholarly journals A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs

Algorithmica ◽  
2015 ◽  
Vol 75 (1) ◽  
pp. 84-117 ◽  
Author(s):  
Marie-Louise Bruner ◽  
Martin Lackner
Keyword(s):  
Pattern Matching ◽  
Fast Algorithm ◽  
Permutation Pattern

scholarly journals Permutation Pattern matching in (213, 231)-avoiding permutations

2017 ◽  
Vol Vol. 18 no. 2, Permutation... (Permutation Patterns) ◽  
Author(s):  
Both Neou ◽  
Romeo Rizzi ◽  
Stéphane Vialette
Keyword(s):  
Pattern Matching ◽  
Related Problem ◽  
Linear Time ◽  
Time Algorithm ◽  
Linear Time Algorithm ◽  
Matching Problem ◽  
Permutation Pattern ◽  
Special Case ◽  
Longest Subsequence

Given permutations σ of size k and π of size n with k < n, the permutation pattern matching problem is to decide whether σ occurs in π as an order-isomorphic subsequence. We give a linear-time algorithm in case both π and σ avoid the two size-3 permutations 213 and 231. For the special case where only σ avoids 213 and 231, we present a O(max(kn 2 , n 2 log log n)-time algorithm. We extend our research to bivincular patterns that avoid 213 and 231 and present a O(kn 4)-time algorithm. Finally we look at the related problem of the longest subsequence which avoids 213 and 231.

scholarly journals Kernelization lower bound for Permutation Pattern Matching

2015 ◽  
Vol 115 (5) ◽  
pp. 527-531 ◽  
Author(s):  
Ivan Bliznets ◽  
Marek Cygan ◽  
Paweł Komosa ◽  
Lukáš Mach
Keyword(s):  
Lower Bound ◽  
Pattern Matching ◽  
Permutation Pattern

scholarly journals The Complexity of Pattern Matching for $321$-Avoiding and Skew-Merged Permutations

2016 ◽  
Vol Vol. 18 no. 2, Permutation... (Permutation Patterns) ◽  
Author(s):  
Michael H. Albert ◽  
Marie-Louise Lackner ◽  
Martin Lackner ◽  
Vincent Vatter
Keyword(s):  
Pattern Matching ◽  
Polynomial Time ◽  
Matching Problem ◽  
Polynomial Time Algorithms ◽  
Permutation Pattern ◽  
Special Cases ◽  
Np Complete

The Permutation Pattern Matching problem, asking whether a pattern permutation $\pi$ is contained in a permutation $\tau$, is known to be NP-complete. In this paper we present two polynomial time algorithms for special cases. The first algorithm is applicable if both $\pi$ and $\tau$ are $321$-avoiding; the second is applicable if $\pi$ and $\tau$ are skew-merged. Both algorithms have a runtime of $O(kn)$, where $k$ is the length of $\pi$ and $n$ the length of $\tau$.

A linear time algorithm for consecutive permutation pattern matching

2013 ◽  
Vol 113 (12) ◽  
pp. 430-433 ◽  
Author(s):  
M. Kubica ◽  
T. Kulczyński ◽  
J. Radoszewski ◽  
W. Rytter ◽  
T. Waleń
Keyword(s):  
Pattern Matching ◽  
Linear Time ◽  
Time Algorithm ◽  
Linear Time Algorithm ◽  
Permutation Pattern
Sign in / Sign up

Export Citation Format

Share Document