中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
A note on the single genotype resolution problem

文献类型:期刊论文

作者Lin, H; Zhang, ZF; Zhang, QF; Bu, DB; Li, M
刊名JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY
出版日期2004-03-01
卷号19期号:2页码:254-COVER3
关键词haplotype inference single genotype resolution maximum resolution NP-completeness
ISSN号1000-9000
英文摘要This note settles the complexity of the single genotype resolution problem showing it is NP-complete. This solves an open problem raised by P. Bonizzoni, G.D. Vedova, R. Dondi, and J. Li. The same proof also gives an alternative and simpler reduction of the NP-hardness of Maximum Resolution problem.
WOS研究方向Computer Science
语种英语
WOS记录号WOS:000220212700016
出版者SCIENCE CHINA PRESS
源URL[http://119.78.100.204/handle/2XEOYT63/9816]  
专题中国科学院计算技术研究所期刊论文_英文
通讯作者Lin, H
作者单位1.Tsing Hua Univ, Beijing 100084, Peoples R China
2.Chinese Acad Sci, Comp Technol Inst, Bioinformat Lab, Beijing 100080, Peoples R China
3.Univ Sci & Technol China, Anhua 230026, Peoples R China
4.Univ Waterloo, Waterloo, ON N2L 3G1, Canada
推荐引用方式
GB/T 7714
Lin, H,Zhang, ZF,Zhang, QF,et al. A note on the single genotype resolution problem[J]. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY,2004,19(2):254-COVER3.
APA Lin, H,Zhang, ZF,Zhang, QF,Bu, DB,&Li, M.(2004).A note on the single genotype resolution problem.JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY,19(2),254-COVER3.
MLA Lin, H,et al."A note on the single genotype resolution problem".JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 19.2(2004):254-COVER3.

入库方式: OAI收割

来源:计算技术研究所

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。