WMGMP consists in, given a set of genomes with the same set genes, finding a genome that minimizes the sum of the distances between the median and each genome of the set multiplied by its weight.I. It is possible to find more than one different genomes that are answers to this problem.
II. The median between two or more identical genes is a empty
III. Considering two or more genomes with no common adjacencies, the median between them is a set containing all the adjacencies from all the genomes.
IV. There is no known polynomial algorithm to solve WMGMP
Chose the correct alternative:
a) Only I and IV are correct.
b) Only I and II are correct.
c) Only II, III are correct.
d) Only IV is wrong.
e) None of the above.
Original idea by: Mario Akita
Nenhum comentário:
Postar um comentário