%0 Journal Article
%T A Note on the Single Genotype Resolution Problem
%A Hao Lin
%A Ze-Feng Zhang
%A Qiang-Feng Zhang
%A Dong-Bo Bu
%A Ming Li
%A <br>HaoLin
%A Ze-FengZhang
%A Qiang-FengZhang
%A Dong-BoBu
%A MingLi
%J 计算机科学技术学报
%D 2004
%I 
%X 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.
%K haplotype inference
%K single genotype resolution
%K maximum resolution
%K NP-completeness<br>单模标本
%K 单基因分解
%K 最大分辨力
%K DNA
%K SNP
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=C10CA3F399EC136F5672E5C6A919C57A&yid=D0E58B75BFD8E51C&vid=2A8D03AD8076A2E3&iid=0B39A22176CE99FB&sid=2B25C5E62F83A049&eid=2B25C5E62F83A049&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=0&reference_num=9