BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:SATisfaction guaranteed: inverse self-assembly as a colouring prob
 lem - John Russo (Sapienza Università di Roma)
DTSTART:20231130T150000Z
DTEND:20231130T160000Z
UID:TALK208597@talks.cam.ac.uk
DESCRIPTION:&nbsp\;The goal of inverse self-assembly is to design inter-pa
 rticle interactions capable of assembling the units into a desired target 
 structure. Here\, we propose a general framework named SAT-assembly [1\,2]
 \, in which the interaction rules between the building blocks are coloured
  according to the solutions of a Boolean satisfiability problem (SAT) to e
 nsure that all bonds are formed in the target structure. Additional condit
 ions\, such as the non-satisfiability of competing structures [1\,2]\, the
  presence of azeotropic points [3]\, and two-step nucleation mechanisms [4
 ]\, can also be imposed\, allowing for effective engineering of the assemb
 ly path and a significant increase in yield. We will present several examp
 les of successful in-silico assemblies\, ranging from photonic crystals [1
 \,2\,5] to capsids [6]\, and the first experimental realization of some of
  these designs.
LOCATION:Seminar Room 2\, Newton Institute
END:VEVENT
END:VCALENDAR