排序方式: 共有1条查询结果,搜索用时 0 毫秒
1
1.
Andronescu Mirela Dees Danielle Slaybaugh Laura Zhao Yinglei Condon Anne Cohen Barry Skiena Steven 《Natural computing》2003,2(4):391-415
We present an efficient algorithm for determining whether all moleculesin a combinatorial set of DNA or RNA strandsare structure free, and thus availablefor bonding to their Watson-Crick
complements.This work is motivated by the goalof testing whether strands used in DNAcomputations or as molecular bar-codesare
structure free, where the strands areconcatenations of short words. We alsopresent an algorithm for determining whetherall
words in S*, for some finite setS of equi-length words, are structure free.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
1