Finding pattern matchings for permutations
From MaRDI portal
Publication:290212
DOI10.1016/S0020-0190(97)00029-XzbMath1337.68305MaRDI QIDQ290212
Publication date: 1 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) Algorithms on strings (68W32)
Related Items (18)
AVERAGE-CASE ANALYSIS OF PERFECT SORTING BY REVERSALS ⋮ Pattern matching for permutations ⋮ Order-preserving indexing ⋮ A fast algorithm for permutation pattern matching based on alternating runs ⋮ A linear time algorithm for consecutive permutation pattern matching ⋮ Indexing permutations for binary strings ⋮ Sub-quadratic time and linear space data structures for permutation matching in binary strings ⋮ Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations ⋮ Algorithms for testing occurrences of length 4 patterns in permutations ⋮ Unnamed Item ⋮ An efficient parallel algorithm for building the separating tree ⋮ On the longest upsequence problem for permutations ⋮ Parallel algorithms for separable permutations ⋮ Unnamed Item ⋮ Constructing separable Arnold snakes of Morse polynomials ⋮ Finding and counting permutations via CSPs ⋮ Average-Case Analysis of Perfect Sorting by Reversals ⋮ Kernelization lower bound for permutation pattern matching
Cites Work
This page was built for publication: Finding pattern matchings for permutations
