Sciweavers

19 search results - page 3 / 4
» Genomic Distances under Deletions and Insertions
Sort
View
TALG
2008
131views more  TALG 2008»
13 years 4 months ago
Kinetic and dynamic data structures for closest pair and all nearest neighbors
We present simple, fully dynamic and kinetic data structures, which are variants of a dynamic two-dimensional range tree, for maintaining the closest pair and all nearest neighbors...
Pankaj K. Agarwal, Haim Kaplan, Micha Sharir
CCCG
1993
13 years 6 months ago
Maintaining the Approximate Width of a Set of Points in the Plane
d abstract) Gunter Rotey Christian Schwarzz Jack Snoeyinkx The width of a set of n points in the plane is the smallest distance between two parallel lines that enclose the set. W...
Günter Rote, Christian Schwarz, Jack Snoeyink
RECOMB
2002
Springer
14 years 5 months ago
Comparison of minisatellites
In the class of repeated sequences that occur in DNA, minisatellites have been found polymorphic and became useful tools in genetic mapping and forensic studies. They consist of a...
Eric Rivals, Sèverine Bérard
COMPGEOM
2004
ACM
13 years 10 months ago
Deformable spanners and applications
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
Jie Gao, Leonidas J. Guibas, An Nguyen
ICDT
2012
ACM
226views Database» more  ICDT 2012»
11 years 7 months ago
Bounded repairability for regular tree languages
We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a DTD) into unranked trees satisfying a given targ...
Gabriele Puppis, Cristian Riveros, Slawek Staworko