Nucleic acid sequence design via efficient ensemble defect optimization

序列(生物学) 算法 树(集合论) 核酸二级结构 计算机科学 蛋白质二级结构 数学 组合数学 遗传学 生物 核糖核酸 基因 生物化学
作者
Joseph N. Zadeh,Brian R. Wolfe,Niles A. Pierce
出处
期刊:Journal of Computational Chemistry [Wiley]
卷期号:32 (3): 439-452 被引量:187
标识
DOI:10.1002/jcc.21633
摘要

Abstract We describe an algorithm for designing the sequence of one or more interacting nucleic acid strands intended to adopt a target secondary structure at equilibrium. Sequence design is formulated as an optimization problem with the goal of reducing the ensemble defect below a user‐specified stop condition. For a candidate sequence and a given target secondary structure, the ensemble defect is the average number of incorrectly paired nucleotides at equilibrium evaluated over the ensemble of unpseudoknotted secondary structures. To reduce the computational cost of accepting or rejecting mutations to a random initial sequence, candidate mutations are evaluated on the leaf nodes of a tree‐decomposition of the target structure. During leaf optimization, defect‐weighted mutation sampling is used to select each candidate mutation position with probability proportional to its contribution to the ensemble defect of the leaf. As subsequences are merged moving up the tree, emergent structural defects resulting from crosstalk between sibling sequences are eliminated via reoptimization within the defective subtree starting from new random subsequences. Using a Θ( N 3 ) dynamic program to evaluate the ensemble defect of a target structure with N nucleotides, this hierarchical approach implies an asymptotic optimality bound on design time: for sufficiently large N , the cost of sequence design is bounded below by 4/3 the cost of a single evaluation of the ensemble defect for the full sequence. Hence, the design algorithm has time complexity Ω( N 3 ). For target structures containing N ∈{100,200,400,800,1600,3200} nucleotides and duplex stems ranging from 1 to 30 base pairs, RNA sequence designs at 37°C typically succeed in satisfying a stop condition with ensemble defect less than N /100. Empirically, the sequence design algorithm exhibits asymptotic optimality and the exponent in the time complexity bound is sharp. © 2010 Wiley Periodicals, Inc. J Comput Chem, 2011
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
1秒前
bkagyin应助lyw采纳,获得10
1秒前
1秒前
chentong发布了新的文献求助10
1秒前
鳗鱼寄瑶完成签到,获得积分10
1秒前
坚定的听南完成签到,获得积分10
2秒前
shuo完成签到,获得积分10
2秒前
2秒前
nanaking发布了新的文献求助10
2秒前
怕黑老头发布了新的文献求助10
3秒前
潇洒仇天完成签到,获得积分20
3秒前
jiyia发布了新的文献求助10
3秒前
秦之之完成签到 ,获得积分10
3秒前
ToMoTT完成签到,获得积分10
3秒前
ding应助xiaotong采纳,获得20
3秒前
3秒前
4秒前
鲤鱼雪巧发布了新的文献求助10
4秒前
4秒前
4秒前
sora完成签到,获得积分10
4秒前
4秒前
小马发布了新的文献求助10
5秒前
6秒前
6秒前
6秒前
Ryan发布了新的文献求助10
7秒前
哼哼哒发布了新的文献求助10
7秒前
8秒前
chen完成签到,获得积分20
8秒前
洁净的冬日完成签到 ,获得积分10
8秒前
喜悦豌豆完成签到,获得积分20
8秒前
8秒前
美满又蓝发布了新的文献求助10
8秒前
今后应助几丁质采纳,获得10
9秒前
9秒前
9秒前
十三完成签到,获得积分10
9秒前
10秒前
li发布了新的文献求助30
10秒前
高分求助中
Markov Chain Monte Carlo 10000
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Common Foundations of American and East Asian Modernisation: From Alexander Hamilton to Junichero Koizumi 5000
Matrix Methods in Data Mining and Pattern Recognition Second Edition 610
政治传播过程中的外交与说服——以中苏友好协会为例的历史考察 566
Discerning Saints: Moralization of Intrinsic Motivation and Selective Prosociality at Work 500
Handbuch Trainingswissenschaft – Trainingslehre 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7580222
求助须知:如何正确求助?哪些是违规求助? 9159768
关于积分的说明 19596271
捐赠科研通 7162829
什么是DOI,文献DOI怎么找? 3265857
关于科研通互助平台的介绍 2430774
邀请新用户注册赠送积分活动 2256746