Finding pattern matchings for permutations
From MaRDI portal
Publication:290212
DOI10.1016/S0020-0190(97)00029-XzbMATH Open1337.68305MaRDI QIDQ290212FDOQ290212
Authors: Louis Ibarra 
Publication date: 1 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Recommendations
- Pattern matching for permutations
- Pattern matching for permutations
- Pattern matching for separable permutations
- Pattern matching in the cycle structures of permutations
- Pattern matching for 321-avoiding permutations
- Pattern matching for \(k\)-track permutations
- Hardness of permutation pattern matching
- Parity permutation pattern matching
- scientific article; zbMATH DE number 1504635
- Boxed permutation pattern matching
Permutations, words, matrices (05A05) Combinatorics in computer science (68R05) Algorithms on strings (68W32)
Cites Work
Cited In (23)
- Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations
- Longest Common Separable Pattern Among Permutations
- Title not available (Why is that?)
- Kernelization lower bound for permutation pattern matching
- Average-case analysis of perfect sorting by reversals
- Constructing separable Arnold snakes of Morse polynomials
- Pattern matching for permutations
- Pattern matching for permutations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Order-preserving indexing
- A fast algorithm for permutation pattern matching based on alternating runs
- A linear time algorithm for consecutive permutation pattern matching
- Sub-quadratic time and linear space data structures for permutation matching in binary strings
- Parity permutation pattern matching
- Finding and counting permutations via CSPs
- Parallel algorithms for separable permutations
- Indexing permutations for binary strings
- Algorithms for testing occurrences of length 4 patterns in permutations
- On the longest upsequence problem for permutations
- Pattern matching in the cycle structures of permutations
- Average-Case Analysis of Perfect Sorting by Reversals
- An efficient parallel algorithm for building the separating tree
This page was built for publication: Finding pattern matchings for permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q290212)
