Skip to main content

Table 1 Distances of the received codeword at various presumed word lengths

From: Levenshtein error-correcting barcodes for multiplexed DNA sequencing

Presumed Presumed Candidate
word length word boundary barcodes
   “CAGG” “CGTC”
3 “CGG|CA” 1 2
4 “CGGC|A” 2 1
5 “CGGCA|” 3 2
  1. We compare two candidate barcodes “CAGG” and “CGTC” with different presumed word lengths and boundaries. Levenshtein distances for word boundaries presumed at 3 and 4 conflict and an unambiguous identification of the original used barcode is not possible.