{"doi":"10.1093/synbio/ysaa001","title":"Universal loop assembly: open, efficient and cross-kingdom DNA fabrication","abstract":"Abstract Standardized type IIS DNA assembly methods are becoming essential for biological engineering and research. These methods are becoming widespread and more accessible due to the proposition of a ‘common syntax’ that enables higher interoperability between DNA libraries. Currently, Golden Gate (GG)-based assembly systems, originally implemented in host-specific vectors, are being made compatible with multiple organisms. We have recently developed the GG-based Loop assembly system for plants, which uses a small library and an intuitive strategy for hierarchical fabrication of large DNA constructs (>30 kb). Here, we describe ‘universal Loop’ (uLoop) assembly, a system based on Loop assembly for use in potentially any organism of choice. This design permits the use of a compact number of plasmids (two sets of four odd and even vectors), which are utilized repeatedly in alternating steps. The elements required for transformation/maintenance in target organisms are also assembled as standardized parts, enabling customization of host-specific plasmids. Decoupling of the Loop assembly logic from the host-specific propagation elements enables universal DNA assembly that retains high efficiency regardless of the final host. As a proof-of-concept, we show the engineering of multigene expression vectors in diatoms, yeast, plants and bacteria. These resources are available through the OpenMTA for unrestricted sharing and open access.","journal":"Synthetic Biology","year":2020,"id":58781,"datarank":0.0,"base_score":0.0,"endowment":0.0,"self_citation_contribution":0.0,"citation_network_contribution":0.0,"self_endowment_contribution":0.0,"citer_contribution":0.0,"corpus_percentile":null,"corpus_rank":null,"citation_count":70,"citer_count":0,"citers_with_citation_signal":0,"citers_with_endowment":0,"datacite_reuse_total":0,"is_dataset":false,"is_dataset_confidence":0.9507,"is_data_producer":false,"deposit_databanks":null,"is_oa":true,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":"2020-01-01","fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":308428,"name":"Tamara Matúte","orcid":"0000-0002-0486-985X","position":1,"is_corresponding":false},{"id":308429,"name":"Isaac Núñez","orcid":"0000-0002-4439-3745","position":2,"is_corresponding":false},{"id":308430,"name":"Ariel Cerda","orcid":"0009-0007-3040-4849","position":3,"is_corresponding":false},{"id":309941,"name":"Constanza López","orcid":null,"position":4,"is_corresponding":false},{"id":309942,"name":"Valentina Vargas","orcid":null,"position":5,"is_corresponding":false},{"id":308431,"name":"Anton Kan","orcid":"0000-0001-9058-0464","position":6,"is_corresponding":false},{"id":308432,"name":"Vincent A. Bielinski","orcid":"0000-0002-8107-8752","position":7,"is_corresponding":false},{"id":308433,"name":"Peter von Dassow","orcid":"0000-0002-1858-1953","position":8,"is_corresponding":false},{"id":28878,"name":"Christopher L. Dupont","orcid":"0000-0002-0896-6542","position":9,"is_corresponding":false},{"id":308434,"name":"Fernán Federici","orcid":"0000-0001-9200-5383","position":10,"is_corresponding":false},{"id":308427,"name":"Bernardo Pollak","orcid":"0000-0003-2329-7401","position":0,"is_corresponding":true}],"reference_count":48,"raw_metadata":null,"created_at":"2026-07-18T21:07:33.416320Z","pmid":"32161816","pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}