科研之友
微信
新浪微博
Facebook
分享链接
摘要
One important approach for DNA sequencing consists of finding a shortest string s that contains all the si as substrings for a set {s(1), s(2), . . . , s(n)} of (adenine, guanine, cytosine, and thymine) strings. This problem is modeled under the name the shortest superstring problem. In this paper, an iterated local search algorithm is proposed to solve this problem. Experiment results show that this algorithm can obtain higher quality solutions on DNA sequencing than those from other heuristics for many instances.
- 出版日期2014-7
- 单位成都大学
