请帮忙看看我的论文是否被sci检索,检索号是多少,论文名:Order Neighborhood Searches for DNA Coding 只看是否被每被Sci检索,EI就算了,
来源:学生作业帮助网 编辑:六六作业网 时间:2024/12/23 05:29:25
请帮忙看看我的论文是否被sci检索,检索号是多少,论文名:Order Neighborhood Searches for DNA Coding 只看是否被每被Sci检索,EI就算了,
请帮忙看看我的论文是否被sci检索,检索号是多少,
论文名:Order Neighborhood Searches for DNA Coding 只看是否被每被Sci检索,EI就算了,
请帮忙看看我的论文是否被sci检索,检索号是多少,论文名:Order Neighborhood Searches for DNA Coding 只看是否被每被Sci检索,EI就算了,
Order Neighborhood Searches for DNA Coding
作者: Wang, Q (Wang, Qian)[ 1 ] ; Zhang, Q (Zhang, Qiang)[ 1 ] ; Wei, XP (Wei, Xiaopeng)[ 1 ]
来源出版物: JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE 卷: 8 期: 1 页: 102-104 DOI: 10.1166/jctn.2011.1666 出版年: JAN 2011
被引频次: 1 (来自 Web of Science)
引用的参考文献: 18 [ 查看 Related Records ] 引证关系图
摘要: In this paper, an order neighborhood search method for DNA sequence design is proposed, It combines binary template and 4-ary (A,T,G,C) and uses local search frameworks to deal with the constraints in order neighborhood. The constraints in this paper include Hamming distance and reverse Hamming distance, but our algorithm can be easily extended for handling other constraints. Comparing the results obtained by our experiment with the previous works, we improve the upper bounds of DNA Coding.
入藏号: WOS:000289698000018
文献类型: Article
语种: English
作者关键词: DNA Coding; Order Neighborhood Search; Hamming Distance
KeyWords Plus: CONSTANT GC-CONTENT; CODES; DESIGN; BOUNDS
通讯作者地址: Zhang, Q (通讯作者)
Dalian Univ, Minist Educ, Key Lab Adv Design & Intelligent Comp, Dalian 116622, Liaoning, Peoples R China.
地址:
[ 1 ] Dalian Univ, Minist Educ, Key Lab Adv Design & Intelligent Comp, Dalian 116622, Liaoning, Peoples R China
作者标识符:
基金资助致谢:
基金资助机构 授权号
National Natural Science Foundation of China 30870573
National High Technology Research and Development Program ("863"Program) of China 2009AA01Z416