A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä

A systematic approach to inserting split inteins for Boolean logic gate engineering and basal activity reduction




TekijätHo Trevor Y. H., Shao Alexander, Lu Zeyu, Savilahti Harri, Menolascina Filippo, Wang Lei, Dalchau Neil, Wang Baojun

KustantajaNATURE RESEARCH

Julkaisuvuosi2021

JournalNature Communications

Tietokannassa oleva lehden nimiNATURE COMMUNICATIONS

Lehden akronyymiNAT COMMUN

Artikkelin numeroARTN 2200

Vuosikerta12

Sivujen määrä12

ISSN2041-1723

eISSN2041-1723

DOIhttps://doi.org/10.1038/s41467-021-22404-9

Rinnakkaistallenteen osoitehttps://research.utu.fi/converis/portal/detail/Publication/56205308


Tiivistelmä
Split inteins are powerful tools for seamless ligation of synthetic split proteins. Yet, their use remains limited because the already intricate split site identification problem is often complicated by the requirement of extein junction sequences. To address this, we augment a mini-Mu transposon-based screening approach and devise the intein-assisted bisection mapping (IBM) method. IBM robustly reveals clusters of split sites on five proteins, converting them into AND or NAND logic gates. We further show that the use of inteins expands functional sequence space for splitting a protein. We also demonstrate the utility of our approach over rational inference of split sites from secondary structure alignment of homologous proteins, and that basal activities of highly active proteins can be mitigated by splitting them. Our work offers a generalizable and systematic route towards creating split protein-intein fusions for synthetic biology. Split inteins are powerful tools for designing synthetic split proteins. Here the authors use a mini-Mu transposon screen to map split sites, enabling the development of protein-based logic gates and fine control of protein activity.

Ladattava julkaisu

This is an electronic reprint of the original article.
This reprint may differ from the original in pagination and typographic detail. Please cite the original version.





Last updated on 2024-26-11 at 17:48