On Dependent Randomized Rounding Algorithms
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Positive Linear Programming, Parallel Approximation and PCP's
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
On the approximability of maximum and minimum edge clique partition problems
CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
Fingerprint clustering with bounded number of missing values
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
The minimum spanning tree problem with conflict constraints and its variations
Discrete Optimization
On the approximability of maximum and minimum edge clique partition problems
CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51
| Hi-index | 0.00 |
We study the problem of clustering fingerprints with at most p missing values (CMV (p) for short) naturally arising in oligonucleotide fingerprinting, which is an efficient method for characterizing DNA clone libraries.We show that already CMV(2) is NP-hard. We also show that a greedy algorithm yields a min(1 + ln n, 2+pln l) approximation for CMV(p), and can be implemented to run in O(nl2p) time. Furthermore, we introduce other variants of the problem of clustering fingerprints with at most p missing values based on slightly different optimization criteria and show that they can be approximated in polynomial time with ratios 22p-1 and 2(1 - [EQUATION]), respectively.