Fig. 2: Time and memory efficiency of seqwalk in comparison with a reimplementation of the DeLOB method, described in ref. 7, for the problem of designing 25-nt barcodes satisfying SSM k = 12, with no additional sequence constraints. | Nature Computational Science

Fig. 2: Time and memory efficiency of seqwalk in comparison with a reimplementation of the DeLOB method, described in ref. 7, for the problem of designing 25-nt barcodes satisfying SSM k = 12, with no additional sequence constraints.

From: Scalable design of orthogonal DNA barcode libraries

Fig. 2: Time and memory efficiency of seqwalk in comparison with a reimplementation of the DeLOB method, described in ref. 7, for the problem of designing 25-nt barcodes satisfying SSM k = 12, with no additional sequence constraints.

DeLOB was run with varying choices for number of candidate sequences from 103 to 105, resulting in a range of computational costs and library sizes. All computations were performed using a single CPU core.

Source data.

Back to article page