Figure 1

NBLAST task partitioning and unique identifier assignment scheme. (a) The division of the all-against-all (N²) sequence comparison using NBLAST is shown here for i = 4 computers. Each computer is allocated N/i rows from the sequence database, which are partitioned between the upper half and the lower half of the triangle. This results in an equivalent number of N²/(2^*i) comparisons for each computer over a similar time frame. (b) The mapping function generates a unique identifier (UID) (in small boxes) for pairwise comparison between ordinal numbers (ORD1, ORD2) assigned to database records.