Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

EJC
2010

favoriteEmaildiscussreport

104views Information Technology» more EJC 2010»

Packing sets of patterns

13 years 4 months ago

Packing sets of patterns

Download www.helsinki.fi

Packing density is a permutation occurrence statistic which describes the maximal number of permutations of a given type that can occur in another permutation. In this article we focus on containment of sets of permutations. Although this question has been tangentially considered previously, this is the first article focusing exclusively on it. We find the packing density for various special sets of permutations and study permutation and pattern co-occurrence.

Alexander Burstein, Peter Hästö

Real-time Traffic

EJC 2007 | EJC 2010 | Maximal Number | Permutation | Permutation Occurrence |

claim paper

Related Content

» Mining protein family specific residue packing patterns from protein structure graphs

» Bubble mesh automated triangular meshing of nonmanifold geometry by sphere packing

» Multiobjective strip packing using an evolutionary algorithm

» Maximizing the Number of Packed Rectangles

» On the packing chromatic number of Cartesian products hexagonal lattice and trees

» Improving Dense Packings of Equal Disks in a Square

» Packing multiway cuts in capacitated graphs

» A Polynomial Time Approximation Scheme for the Square Packing Problem

» Search Strategies for Rectangle Packing

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2010
Where	EJC
Authors	Alexander Burstein, Peter Hästö

Comments (0)