Skip to main content

Table 2 Example decoding results

From: Levenshtein error-correcting barcodes for multiplexed DNA sequencing

Candidate barcode Distance to “TCCATGCATA” Possible chain of operations Resulting word boundary
“TTCC” 1 del(2),elong(“ATGCATA”) 3 (“TCC|ATGCATA”)
“ACAC” 2 sub(“T”,1),del(3),elong(“ATGCATA”) 3 (“TCC|ATGCATA”)
“CGAA” 3 ins(“T”,1),sub(“C”,3),del(5),elong(“TGCATA”) 4 (“TCCA|TGCATA”)
“TAGG” 3 sub(“C”,2),sub(“C”,3),sub(“A”,4),elong(“TGCATA”) 4 (“TCCA|TGCATA”)
  1. Table shows the results of decoding the example sequence read “TCCATGCATA” for four different candidate barcodes “TTCC”, “ACAC”, “CGAA”, and “TAGG”. The real original barcode “TTCC” has the shortest Sequence-Levenshtein distance to this sequence read and the word boundary is estimated correctly at 3.