Dana Gretton

Dana Gretton

Auto-generated profile, based on publicly available information

Dana Gretton

MIT Media Lab, Massachusetts Institute of Technology, Cambridge, Massachusetts, USA

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 March 2021 in Molecular Systems Biology
Verified
Journal Article
Open access
PDF file
ECEmma J Chory
Emma J Chory
DGDana W Gretton
Dana W Gretton
EDErika A DeBenedictis
Erika A DeBenedictis
KEKevin M Esvelt
Kevin M Esvelt
Our understanding of complex living systems is limited by our capacity to perform experiments in high throughput. While robotic systems have automated many traditional hand‐pipetting protocols, software limitations have precluded more advanced maneuvers required to manipulate, maintain, and monitor hundreds of experiments in parallel. Here, we present Pyhamilton, an open‐source Python platform that can execute complex pipetting patterns required for custom high‐throughput experiments such as the simulation of metapopulation dynamics. With an integrated plate reader, we maintain nearly 500 remotely monitored bacterial cultures in log‐phase growth for days without user intervention by taking regular density measurements to adjust the robotic method in real‐time. Using these capabilities, we systematically optimize bioreactor protein production by monitoring the fluorescent protein expression and growth rates of a hundred different continuous culture conditions in triplicate to comprehensively sample the carbon, nitrogen, and phosphorus fitness landscape. Our results demonstrate that flexible software can empower existing hardware to enable new types and scales of experiments, empowering areas from biomanufacturing to fundamental biology.

2 April 2024 in bioRxiv
Verified
Preprint
Open access
PDF file
DGDana Gretton
Dana Gretton
BWBrian Wang
Brian Wang
RERey Edison
Rey Edison
LFLeonard Foner
Leonard Foner
JBJens Berlips
Jens Berlips
KEKevin M. Esvelt
Kevin M. Esvelt
Custom DNA synthesis underpins modern biology, but hazardous genes in the wrong hands could threaten many lives and public trust in science. In 1992, a virology-trained mass murderer tried and failed to obtain physical samples of Ebola; today, viruses can be assembled from synthetic DNA fragments. Screening orders for hazards is unreliable and expensive because similarity search algorithms yield false alarms requiring expert human review. Here we develop “random adversarial threshold” (RAT) search, which looks for exact matches to short nucleic acid and peptide subsequence windows from hazards and predicted functional variants that aren’t found in any known innocuous genes. To experimentally assess sensitivity, we used RAT search to protect nine windows from the M13 bacteriophage virus, then invited a “red team” to launch up to 21,000 attacks at each window and measure the fitness of their designed mutants. We identified defensible windows from regulated pathogens, built a curated test database that our M13 experiments indicate will block 99.999% of functional attacks, and verified its sensitivity against orders designed to evade detection. RAT search offers a way to safeguard biotechnology by securely automating DNA synthesis screening. Summary Searching for exact matches to pre-computed functional variants unique to hazardous genes enables sensitive, secure, and automated DNA synthesis screening.

2 April 2020 in bioRxiv
Verified
Preprint
Open access
PDF file
EDErika A. DeBenedictis
Erika A. DeBenedictis
ECEmma J. Chory
Emma J. Chory
DGDana Gretton
Dana Gretton
BWBrian Wang
Brian Wang
KEKevin Esvelt
Kevin Esvelt
Continuous directed evolution rapidly implements cycles of mutagenesis, selection, and replication to accelerate protein engineering. However, individual experiments are typically cumbersome, reagent-intensive, and require manual readjustment, limiting the number of evolutionary trajectories that can be explored. We report the design and validation of Phage-and-Robotics-Assisted Near-Continuous Evolution (PRANCE), an automation platform for the continuous directed evolution of biomolecules that enables real-time activitydependent reporter and absorbance monitoring of up to 96 parallel evolution experiments. We use this platform to characterize the evolutionary stochasticity of T7 RNA polymerase evolution, conserve precious reagents with miniaturized evolution volumes during evolution of aminoacyl-tRNA synthetases, and perform a massively parallel evolution of diverse candidate quadruplet tRNAs. Finally, we implement a feedback control system that autonomously modifies the selection strength in response to real-time fitness measurements. By addressing many of the limitations of previous methods within a single platform, PRANCE simultaneously enables multiplexed, miniaturized, and feedback-controlled continuous directed evolution.

7 October 2024 in IACR Communications in Cryptology
Verified
Journal Article
Open access
PDF file
CBCarsten Baum
Carsten Baum
JBJens Berlips
Jens Berlips
WCWalther Chen
Walther Chen
IDIvan B. Damgård
Ivan B. Damgård
KEKevin M. Esvelt
Kevin M. Esvelt
YYYu Yu
Yu Yu
Oblivious Pseudorandom Functions (OPRFs) allow a client to evaluate a pseudorandom function (PRF) on her secret input based on a key that is held by a server. In the process, the client only learns the PRF output but not the key, while the server neither learns the input nor the output of the client. The arguably most popular OPRF is due to Naor, Pinkas and Reingold (Eurocrypt 2009). It is based on an Oblivious Exponentiation by the server, with passive security under the Decisional Diffie-Hellman assumption. In this work, we strengthen the security guarantees of the NPR OPRF by protecting it against active attacks of the server. We have implemented our solution and report on the performance. Our main result is a new batch OPRF protocol which is secure against maliciously corrupted servers, but is essentially as efficient as the semi-honest solution. More precisely, the computation (and communication) overhead is a multiplicative factor o ( 1 ) as the batch size increases. The obvious solution using zero-knowledge proofs would have a constant factor overhead at best, which can be too expensive for certain deployments. Our protocol relies on a novel version of the DDH problem, which we call the Oblivious Exponentiation Problem (OEP), and we give evidence for its hardness in the Generic Group model. We also present a variant of our maliciously secure protocol that does not rely on the OEP but nevertheless only has overhead o ( 1 ) over the known semi-honest protocol. Moreover, we show that our techniques can also be used to efficiently protect threshold blind BLS signing and threshold ElGamal decryption against malicious attackers.

16 April 2020 in bioRxiv
Verified
Preprint
Open access
PDF file
ECEmma J Chory
Emma J Chory
DGDana W Gretton
Dana W Gretton
EDErika A DeBenedictis
Erika A DeBenedictis
KEKevin M Esvelt
Kevin M Esvelt
INTRODUCTION: Liquid handling robots have become a biotechnology staple 1,2 , allowing laborious or repetitive protocols to be executed in high-throughput. However, software narrowly designed to automate traditional hand-pipetting protocols often struggles to harness the full capabilities of robotic manipulation. Here we present Pyhamilton, an open-source Python package that eliminates these constraints, enabling experiments that could never be done by hand. We used Pyhamilton to double the speed of automated bacterial assays over current software and execute complex pipetting patterns to simulate population dynamics. Next, we incorporated feedback-control to maintain hundreds of remotely monitored bacterial cultures in log-phase growth without user intervention. Finally, we applied these capabilities to comprehensively optimize bioreactor protein production by maintaining and monitoring fluorescent protein expression of nearly 500 different continuous cultures to explore the carbon, nitrogen, and phosphorus fitness landscape. Our results demonstrate Pyhamilton’s empowerment of existing hardware to new applications ranging from biomanufacturing to fundamental biology.

25 April 2025
Verified
Conference Paper
Open access
ASAubrey Simonson
Aubrey Simonson
DGDana Gretton
Dana Gretton
CHCasper Harteveld
Casper Harteveld