𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Permutation-pattern algebras

✍ Scribed by Endre Vármonostory

Publisher
Springer
Year
2001
Tongue
English
Weight
90 KB
Volume
45
Category
Article
ISSN
0002-5240

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Pattern matching for permutations
Pattern matching for permutations
✍ Prosenjit Bose; Jonathan F. Buss; Anna Lubiw 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 638 KB

## Given a permutation T of 1 to n, and a permutation P of 1 to k, for k < n, we wish to find a k-element subsequence of T whose elements are ordered according to the permutation P. For example, if P is ( 1,2, . . . , k), then we wish to find an increasing subsequence of length k in T; this specia

Permutations Containing Many Patterns
Permutations Containing Many Patterns
✍ M. H. Albert; Micah Coleman; Ryan Flynn; Imre Leader 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 148 KB
Finding pattern matchings for permutatio
Finding pattern matchings for permutations
✍ Louis Ibarra 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 267 KB

GivenapermutationPof{l,..., k}andTof{l,..., n}, k < n, the pattern matching problem for permutations is to determine whether there is a length k subsequence of T whose elements are ordered in the same way as the elements of P. We present an 0( kn4) time and 0( kn3) space algorithm for finding a matc