028-2015

MO640 - Multiple-choice question

Given the definition of the Weighted Multichromosomal Genome Median Problem (WMGMP) below:

WMGMP consists in, given a set of genomes with the same gene content, finding a genome that minimizes the sum of the distances between the median and each genome of the set multiplied by its weight.

evaluate the following statements with respect to WMGMP under the SCJ distance:

I. For some instances, it is possible to find different genomes that solve this problem.
II. The median between two or more identical genomes is a genome without adjacencies.
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 time algorithm to solve WMGMP.

and chose the true alternative:

a) Only I and IV are correct.
b) Only I and II are correct.
c) Only II and III are correct.
d) Only IV is wrong.
e) None of the above.

Original idea by: Mario Akita