Recombinase-Based Genetic Circuit Optimization

Abstract : The rapid advancements of synthetic biology show promising potential in biomedical and other applications. Recently, recombinases were proposed as a tool to engineer genetic logic circuits with long-term memory in living and even mammalian cells. The technology is under active development, and the complexity of engineered genetic circuits grows continuously. However, how to minimize a genetic circuit composed of recombinase-based logic gates remain largely open. In this paper, we formulate the problem as a cubic-time assignment problem and solved by a 0/1-ILP solver to minimize DNA sequence length of genetic circuits. Experimental results show effective reduction of our optimization method, which may be crucial to enable practical realization of complex genetic circuits.
Document type :
Poster communications
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download

https://hal.inria.fr/hal-01659183
Contributor : François Fages <>
Submitted on : Friday, December 8, 2017 - 11:02:40 AM
Last modification on : Wednesday, December 13, 2017 - 4:28:23 PM

File

LJF17biocas.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01659183, version 1

Collections

Citation

Chun-Ning Lai, Jie-Hong Jiang, François Fages. Recombinase-Based Genetic Circuit Optimization. BioCAS 2017 - 13th IEEE Biomedical Circuits and Systems Conference, Oct 2017, Turin, Italy. pp.1-4, 2017. ⟨hal-01659183⟩

Share

Metrics

Record views

251

Files downloads

204