Scalable design of orthogonal DNA barcode libraries

IF 12 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Gokul Gowri, Kuanwei Sheng, Peng Yin
{"title":"Scalable design of orthogonal DNA barcode libraries","authors":"Gokul Gowri, Kuanwei Sheng, Peng Yin","doi":"10.1038/s43588-024-00646-z","DOIUrl":null,"url":null,"abstract":"Orthogonal DNA barcode library design is an essential task in bioengineering. Here we present seqwalk, an efficient method for designing barcode libraries that satisfy a sequence symmetry minimization (SSM) heuristic for orthogonality, with theoretical guarantees of maximal or near-maximal library size under certain design constraints. Seqwalk encodes SSM constraints in a de Bruijn graph representation of sequence space, enabling the application of recent advances in discrete mathematics1 to the problem of orthogonal sequence design. We demonstrate the scalability of seqwalk by designing a library of >106 SSM-satisfying barcode sequences in less than 20 s on a standard laptop. Seqwalk is a scalable method for designing orthogonal DNA barcode libraries, producing one million barcodes in 20 s on a standard laptop.","PeriodicalId":74246,"journal":{"name":"Nature computational science","volume":null,"pages":null},"PeriodicalIF":12.0000,"publicationDate":"2024-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11208133/pdf/","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Nature computational science","FirstCategoryId":"1085","ListUrlMain":"https://www.nature.com/articles/s43588-024-00646-z","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Orthogonal DNA barcode library design is an essential task in bioengineering. Here we present seqwalk, an efficient method for designing barcode libraries that satisfy a sequence symmetry minimization (SSM) heuristic for orthogonality, with theoretical guarantees of maximal or near-maximal library size under certain design constraints. Seqwalk encodes SSM constraints in a de Bruijn graph representation of sequence space, enabling the application of recent advances in discrete mathematics1 to the problem of orthogonal sequence design. We demonstrate the scalability of seqwalk by designing a library of >106 SSM-satisfying barcode sequences in less than 20 s on a standard laptop. Seqwalk is a scalable method for designing orthogonal DNA barcode libraries, producing one million barcodes in 20 s on a standard laptop.

Abstract Image

可扩展的正交 DNA 条形码库设计。
正交 DNA 条形码文库设计是生物工程中的一项重要任务。在此,我们介绍一种高效的条形码文库设计方法 Seqwalk,该方法满足序列对称性最小化(SSM)启发式正交性要求,理论上保证了在特定设计约束条件下最大或接近最大的文库规模。Seqwalk 将 SSM 约束条件编码为序列空间的 de Bruijn 图表示法,从而将离散数学1 的最新进展应用于正交序列设计问题。我们在一台标准笔记本电脑上用不到 20 秒的时间就设计出了大于 106 个满足 SSM 的条形码序列库,证明了 seqwalk 的可扩展性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
11.70
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信