Packing Patterns into Words
Open Access
- 31 October 2002
- journal article
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 9 (2) , R20
Abstract
In this article we generalize packing density problems from permutations to patterns with repeated letters and generalized patterns. We are able to find the packing density for some classes of patterns and several other short patterns.Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- The Packing Density of Other Layered PermutationsThe Electronic Journal of Combinatorics, 2002
- Pattern Frequency Sequences and Internal ZerosAdvances in Applied Mathematics, 2002
- On Packing Densities of PermutationsThe Electronic Journal of Combinatorics, 2002
- Restricted PermutationsEuropean Journal of Combinatorics, 1985
- The Complexity of Some Problems on Subsequences and SupersequencesJournal of the ACM, 1978
- A lower bound on the length of a sequence containing all permutations as subsequencesJournal of Combinatorial Theory, Series A, 1976
- Sorting Using Networks of Queues and StacksJournal of the ACM, 1972