Table 2 |
||||
|
The error detection power of the nuID checksum algorithm (N = 21) |
||||
|
L |
1-character |
2-character |
3-character |
Random |
|
|
||||
|
25mer |
0.97780 |
0.97918 |
0.98689 |
0.99924 |
|
50mer |
0.97724 |
0.97838 |
0.98607 |
0.99997 |
|
100mer |
0.97894 |
0.97825 |
0.98617 |
1* |
|
|
||||
|
L and N are defined in Equation (3) and (4) in Methods. The column "1-character" is the error detection rate of an nuID with only one character mutated. Similar definition for column "2-character" and "3-character". "Random" column is error detection rate of a random ASCII string. The optimum detection power is 1.0. * We realize the detection of nuIDs for 100mers is not guaranteed, but in none of our simulations did we ever encounter a randomly assembled string that was a valid nuID. |
||||
|
Du et al. Biology Direct 2007 2:16 doi:10.1186/1745-6150-2-16 |
||||