Phylogenetic tree searching algorithms often produce thousands of trees which biologists save in Newick format in order to perform further analysis. Unfortunately, Newick is neithe...
Robert S. Boyer, Warren A. Hunt Jr., Serita M. Nel...
In order to answer efficiently range queries in 2-d R-trees, first we sort queries by means of a space filling curve, then we group them together, and finally pass them for process...
In this paper, we consider the challenging problem of object duplicate detection and localization. Several applications require efficient object duplicate detection methods, such ...
The disparity between data collected in rural and urban counties is often detrimental in the appropriate analysis of cancer care statistics. Low counts drastically affect the inci...
Ross Maciejewski, Travis Drake, Stephen Rudolph, A...
The distance join is a spatial join that finds pairs of closest objects in the order of distance by associating two spatial data sets. The distance join stores node pairs in a pri...