Generalizations of superimposed codes with applications to efficient design of pooling experiments

We introduce a parameterized generalization of the well known superimposed codes. We give algorithms for their constructions and provide non-existential results. We apply our new combinatorial structures to the efficient solution of group testing problems arising in the realm of computational molecular biology.