Figure 7From: 160-fold acceleration of the Smith-Waterman algorithm using a field programmable gate array (FPGA)Computation speed and time. A, Computation time (in milliseconds) and B, speed (cell evaluated per millisecond) as functions of query DNA sequence length (in base-pairs). Circles are the 64×SCM implementation; squares are 1×SCM implementation; and diamonds are pure software implementation.Back to article page