Skip to main content
Figure 8 | BMC Bioinformatics

Figure 8

From: ADaM: augmenting existing approximate fast matching algorithms with efficient and exact range queries

Figure 8

Query and build times for different pivot selections and different lengths of query sequences. Also included are points for the number of trees for each build. High number of trees typically corresponds with longer query times (as is the case with Poor selection and query length of 8, where the number of trees is 493). Random and Optimal have the same number of trees at l = 16, 32, and 64.

Back to article page