167 search results - page 21 / 34 » On the complexity and approximation of syntenic distance |
113
click to vote
COMPGEOM
2000
ACM
15 years 4 months ago
2000
ACM
: We present a new approach for computing generalized Voronoi diagrams in two and three dimensions using interpolation-based polygon rasterization hardware. The input primitives ma...
FOCS
2008
IEEE
14 years 12 months ago
2008
IEEE
Recent years have seen a significant increase in our understanding of high-dimensional nearest neighbor search (NNS) for distances like the 1 and 2 norms. By contrast, our underst...
113
click to vote
WADS
2007
Springer
15 years 5 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
104
Voted
COCO
2009
Springer
15 years 6 months ago
2009
Springer
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
MST
2006
14 years 11 months ago
2006
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...