I have some queries about the partial digest problem(PDP) in restriction mapping: 1.How much important this problem is in the current era of bioinformatics? 2.Whats the best algorithm in terms of time complexity invented so far to solve the problem? 3. if i state the problem in such a way that: Input: The multiset of pairwise distances L, containing(nC2) integers. Output: A set X, of n integers, such that
X = L then in practical cases(means in the practical field for restriction mapping) what can be the maximum size of n? I will be really helpful if any one answer me.....Thanks in advance...