Figure 6

Results of Simulation 3. (A) Number of correct matches after decoding depending on base mutation probability rate p for different error correction codes and barcode lengths. (B) Number correct matches after decoding depending on base mutation probability rate p for the fixed number of 48 barcodes simulated with the smallest eligible error correction codes: Levenshtein code with $d_L^{\mathit{\text{min}}}=3$, length 6; Sequence-Levenshtein code with $d_{\mathit{\text{SL}}}^{\mathit{\text{min}}}=3$, length 7; Levenshtein code with minimum distance $d_L^{\mathit{\text{min}}}=5$, length 9; Sequence-Levenshtein code with minimum distance $d_{\mathit{\text{SL}}}^{\mathit{\text{min}}}=5$, length 11.