搜索结果: 1-1 共查到“理学 Substring Problems”相关记录1条 . 查询时间(0.073 秒)
More Efficient Algorithms for Closest String and Substring Problems
More Efficient Algorithms Closest Strings Substring Problems
2012/11/30
The closest string and substring problems find applications in PCR primer design, genetic probe design, motif finding, and antisense drug design. For their importance, the two problems have been exten...