A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Pattern Matching for Separable Permutations
[chapter]
2016
Lecture Notes in Computer Science
Given a permutation π (called the text) of size n and another permutation σ (called the pattern) of size k, the NP-complete pattern containment problem asks whether σ is contained in π as an order-isomorphic subsequence. In this paper, we focus on separable permutations (those permutations that avoid both 2413 and 3142, or, equivalently, that admit a separating tree). The main contributions presented in this paper are as follows. -We simplify the algorithm of Ibarra to detect an occurrence of a
doi:10.1007/978-3-319-46049-9_25
fatcat:73qkwvhanjgobegpfqmxvfk3f4