Figure 7
From: A tree-based method for the rapid screening of chemical fingerprints
Average query time, different database size. Different strategies tested with k = 1, ..., 4. Each experiment is performed 100 times, and the average query time is presented. All experiments are performed with a Smin of 0.9. The three graphs (a) - (c) show the performance of the three bucket types for the different values of k. The best k for each method is presented in graph (d) along with the simple linear search results and Baldi.