Tulpan Dan, Andronescu Mirela, Chang Seo Bong, Shortreed Michael R, Condon Anne, Hoos Holger H, Smith Lloyd M
Department of Computer Science, University of British Columbia, Vancouver, BC, V6T 1Z4, Canada.
Nucleic Acids Res. 2005 Sep 6;33(15):4951-64. doi: 10.1093/nar/gki773. Print 2005.
We describe a new algorithm for design of strand sets, for use in DNA computations or universal microarrays. Our algorithm can design sets that satisfy any of several thermodynamic and combinatorial constraints, which aim to maximize desired hybridizations between strands and their complements, while minimizing undesired cross-hybridizations. To heuristically search for good strand sets, our algorithm uses a conflict-driven stochastic local search approach, which is known to be effective in solving comparable search problems. The PairFold program of Andronescu et al. [M. Andronescu, Z. C. Zhang and A. Condon (2005) J. Mol. Biol., 345, 987-1001; M. Andronescu, R. Aguirre-Hernandez, A. Condon, and H. Hoos (2003) Nucleic Acids Res., 31, 3416-3422.] is used to calculate the minimum free energy of hybridization between two mismatched strands. We describe new thermodynamic measures of the quality of strand sets. With respect to these measures of quality, our algorithm consistently finds, within reasonable time, sets that are significantly better than previously published sets in the literature.
我们描述了一种用于设计链集的新算法,用于DNA计算或通用微阵列。我们的算法可以设计出满足多种热力学和组合约束中的任何一种的链集,这些约束旨在最大化链与其互补链之间的期望杂交,同时最小化不期望的交叉杂交。为了启发式地搜索良好的链集,我们的算法使用了冲突驱动的随机局部搜索方法,已知该方法在解决类似的搜索问题时是有效的。使用了Andronescu等人的PairFold程序[M. Andronescu, Z. C. Zhang和A. Condon (2005) J. Mol. Biol., 345, 987 - 1001; M. Andronescu, R. Aguirre - Hernandez, A. Condon, and H. Hoos (2003) Nucleic Acids Res., 31, 3416 - 3422.]来计算两条错配链之间杂交的最小自由能。我们描述了链集质量的新热力学度量。就这些质量度量而言,我们的算法在合理的时间内始终能找到比文献中先前发表的链集明显更好的链集。