47 search results - page 5 / 10 » Exact and Approximation Algorithms for DNA Tag Set Design |
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
DISOPT
2008
13 years 7 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
CIKM
2005
Springer
14 years 1 months ago
2005
Springer
Accurately and efficiently estimating the number of distinct values for some attribute(s) or sets of attributes in a data set is of critical importance to many database operation...
SSDBM
2005
IEEE
14 years 1 months ago
2005
IEEE
Several studies have demonstrated the effectiveness of Haar wavelets in reducing large amounts of data down to compact wavelet synopses that can be used to obtain fast, accurate a...
BMCBI
2006
13 years 7 months ago
2006
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...