Packing patterns into words (Q1422121)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2038335
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Packing patterns into words |
scientific article; zbMATH DE number 2038335 |
Statements
Packing patterns into words (English)
0 references
5 February 2004
0 references
Summary: 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.
0 references
packing density problems
0 references
0.905542016029358
0 references
0.8798067569732666
0 references
0.8716984391212463
0 references
0.8645028471946716
0 references
0.8563066124916077
0 references
