Campuses:

Sequences

Friday, May 22, 2015 - 10:20am - 11:10am
Mike Molloy (University of Toronto)
Mezard and Zdeborova introduced the class of locked CSP's, which appear to be particularly challenging to solve.
They considered Poisson degree sequences truncated so that the minimum degree is two. They discovered a threshold density: below that density all solutions belong to a single cluster; above that density every cluster contains O(1) solutions.
Wednesday, June 17, 2009 - 9:00am - 10:30am
Robert Ghrist (University of Pennsylvania)
No Abstract
Wednesday, February 15, 2012 - 3:15pm - 3:45pm
David Golan (Tel Aviv University)
Despite the rapid decrease in sequencing costs, sequencing a large group of individuals is still prohibitively expensive. Recently, several sophisticated pooling designs were suggested that can identify carriers of rare alleles in large cohorts with a significantly smaller number of lanes, thus dramatically reducing the cost of such large scale genotyping projects. These approaches all use combinatorial pooling designs where each individual is either present in a pool or absent from it.
Subscribe to RSS - Sequences