A quasidouble resolvable 2–(49, 7, 2) design

A 2 -code = Aane Resolvable + Bibd

We say that an A 2-code is optimum if it has the minimum cheating probabilities and the minimum sizes of keys. We rst show that an optimum A 2-code implies an aane-resolvable design. Next, we de-ne an aane-resolvable + BIBD design and prove that an optimum A 2-code is equivalent to an aane-resolvable + BIBD design.

Some new near resolvable BIBDs with k=7 and resolvable BIBDs with k=5

On the Classification of Resolvable 2-(12, 6, 5c) Designs

In this paper we describe a backtrack search over parallel classes with a partial isomorph rejection to classify resolvable 2-(12, 6, 5c) designs. We use the intersection pattern between the parallel classes and the fact that any resolvable 2-(12, 6, 5c) design is also a resolvable 3-(12, 6, 2c) design to effectively guide the search. The method was able to enumerate all nonsimple resolutions a...

????? 7 ???? ??? ??? ?????? ???? ?? 2 ??? ?? ???? ?????? ? ?????? ?????? ????

This article has no abstract.

Abstract 249

Session Information for Program Number 249 Print Close window Abstract Content Program Nr: Mutant phenotypes of the microRNA genes of . , Ezequiel Alvarez-Saavedra , Allison Abbott , Nelson Lau , David P. Bartel , Victor Ambros , Bob Horvitz . 1) HHMI, Dept. Biology, MIT, Cambridge, MA 02139, USA; 2) Dept. Genetics, Dartmouth Medical School, Hanover, NH 03755, USA; 3) Whitehead Institute for Bi...