论文部分内容阅读
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.