Home | About | Journals | Submit | Contact Us | Français |

**|**BMC Bioinformatics**|**v.13; 2012**|**PMC3464616

Formats

Article sections

- Abstract
- Background
- Methods
- Results and discussion
- Conclusions
- Competing interests
- Authors contributions
- References

Authors

Related links

BMC Bioinformatics. 2012; 13: 145.

Published online 2012 June 22. doi: 10.1186/1471-2105-13-145

PMCID: PMC3464616

Tim Massingham: ku.ca.ibe@mahgnissam.mit; Nick Goldman: ku.ca.ibe@namdlog

Received 2012 January 31; Accepted 2012 June 22.

Copyright ©2012 Massingham and Goldman; licensee BioMed Central Ltd.

This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

This article has been cited by other articles in PMC.

The Exact Call Chemistry for the SOLiD Next-Generation Sequencing platform augments the two-base-encoding chemistry with an additional round of ligation, using an alternative set of probes, that allows some mistakes made when reading the first set of probes to be corrected. Additionally, the Exact Call Chemistry allows reads produced by the platform to be decoded directly into nucleotide sequence rather than its two-base ‘color’ encoding.

We apply the theory of linear codes to analyse the new chemistry, showing the types of sequencing mistakes it can correct and identifying those where the presence of an error can only be detected. For isolated mistakes that cannot be unambiguously corrected, we show that the type of substitution can be determined, and its location can be narrowed down to two or three positions, leading to a significant reduction in the the number of plausible alternative reads.

The Exact Call Chemistry increases the accuracy of the SOLiD platform, enabling many potential miscalls to be prevented. However, single miscalls in the color sequence can produce complex but localised patterns of error in the decoded nucleotide sequence. Analysis of similar codes shows that some exist that, if implemented in alternative chemistries, should have superior performance.

The collection of technologies described as Second- or Next- Generation Sequencing (NGS) platforms are characterised by the synthesis of complementary strands of DNA from clusters of homologous templates [1]. The chemistry used differs between the platforms but that for the Life Technologies Corporation SOLiD platform is particularly interesting since there is not a one-to-one correspondence between measurements made during sequencing and nucleotides of the sequence being read. Instead the primary output of the SOLiD platform is a ‘color sequence’, an encoded form of the nucleotide sequence, that has advantages for calling SNPs when comparing the reads to a reference [2]. With the advent of the 5500 Series of machines in November 2010, an improved ‘Exact Call Chemistry’ (ECC) was introduced that changes the way that the sequence is encoded by the platform and allows mistakes in the measurements to be corrected, hence producing more accurate reads [3].

The SOLiD sequencing chemistry consists of multiple rounds where probes, consisting of eight bases and a fluorophore, are sequentially ligated to the template sequence to build up a complementary strand. Each round consists of a priming step followed by a repeated cycle of ligating probes to the template, exciting the fluorophores and imaging the resulting emission, then cleaving the flurophore and part of the probe ready for the next cycle. The probe/fluorophore combinations are designed so that the probes interrogate the first two of the eight ligated positions in the template, with each of four fluorophore colors used to indicate four of the 16 possible nucleotide pairs at these positions. The color of the fluorophore for each template is recorded and used later to determine the sequence of the read. After imaging, those templates to which a probe failed to ligate have their previous probe decapped (i.e. dephosphorylated) so they will not be extended on future cycles. This reduces problems analogous to ‘phasing’ on the Illumina platform [4]. The fluorophore and last three bases are cleaved from the probe, leaving the strand ready to be further extended in the next cycle. The repeated ligation of eight additional bases and then cleaving the end three mean that the pair of bases of the template sequence that is interrogated moves on by five positions every cycle. After a specified number of cycles, the round is stopped and the complementary strand melted from the template to leave the template ready to be primed for the next round. Each round uses a different primer so that the positions interrogated by the probes change each time; for example, on the first round the first position of the probes on cycles 1, 2, … corresponds to positions 1, 6, … of the template sequence; on round two these become positions 2, 7, …, etc.

After five rounds, probes have been ligated so that every position of the template sequence has been the first position of a probe. The colors recorded and prior knowledge of one of the bases, typically the last adapter base adjacent to the template, are sufficient to determine the nucleotide sequence assuming that no errors have been made. Conventionally, one of the rounds is primed so that it starts one base before the beginning of the template sequence and so the first base interrogated is the last base of a known adapter sequence.

The SOLiD Exact Call Chemistry (ECC) augments the ‘two-base-encoding’ chemistry with an extra round where a different set of probes is ligated. Each cycle of this round interrogates positions 1, 2 and 4 of each five-nucleotide block of the template. The same four fluorophores are used, each now indicating the presence of one of 16 of the possible 64 combinations of nucleotides at the positions interrogated. These color calls can be used to detect and recover from miscalls made in previous rounds.

Directly decoding the colors from the first five rounds into nucleotide sequence allows catastrophic failures to occur where a single calling error creates errors in every position from then on [2]. As well as allowing some errors to be corrected, the additional round also enables the calls to be translated into nucleotide sequence in a manner that behaves more gracefully in the presence of mistakes [3].

The mathematical basis for the error correcting properties of the SOLiD ECC is the theory of convolutional codes [3], a class of codes which are incorporated into some of the most powerful error-correcting codes in general use, for example those used in the Voyager deep-space exploration program [5]. Convolutional codes are a category of linear codes [6,7] and we use the theory of linear codes to analyse the error correcting properties of the SOLiD Exact Call Chemistry, describing the types of sequencing mistakes it can correct and those cases where the presence of an error can only be detected. For isolated mistakes that cannot be unambiguously corrected, we show that the type of substitution can be determined and its location can be narrowed down to two or three positions in the read, leading to a significant reduction in the the number of plausible alternative reads. If the read is ‘corrected’ at the wrong location, we show that the nucleotide read ultimately produced contains errors that have a distinctive pattern. Finally, we apply the same techniques used to analyse the Exact Call Chemistry to look at hypothetical alternative chemistries and show that some of them have superior characteristics, being able to correct more errors and inducing simpler patterns of error in the decoded nucleotide sequence when reads are miscorrected.

We start by defining the terminology we need to analyze the SOLiD code. The chemistry of the sequencing reactions and imaging mean that each fragment of DNA, or ‘source sequence’ (nucleotides), is encoded into a ‘code sequence’ (colors) of equal or greater length. The original five rounds produce as many observed colors as there are nucleotides in the fragment; the ECC round adds one-fifth as many additional color calls. The code sequence is then observed with potential errors (‘observed sequence’). Since the code sequence is longer than the source sequence, not all possible code sequences correspond to an encoded source sequence; those that do correspond are termed ‘valid’. Given an observed sequence, some procedure is used to find the closest valid code sequence (‘corrected sequence’) and the nucleotide sequence that produces this code sequence is the decoded sequence. Note that the source sequence and decoded sequence are sequences of nucleotides (‘base-space’), whereas the code, observed and corrected sequences are colors (‘color-space’).

In terms of the theory to be presented, colors and nucleotides are just different representations of the same things, members of a set of four elements over which a finite field (i.e. Galois field, GF_{4}) is defined (see Table Table1).1). To prevent confusion between the various matrices and vectors studied and their concrete representation as nucleotides or colors, all calculations in the text are described in terms of elements GF_{4} and the more usual notations are reserved for when an actual sequence of nucleotides or colors is meant.

The ECC code, and any linear code in general, is defined in terms of a *k*×*n*generator matrix *G* with elements in GF_{4}. A source sequence *s* is a row vector of length *k* consisting of elements of GF_{4}, and its code sequence *c* is *sG* where the vector-matrix multiplication is understood in the usual sense but addition and multiplication of elements is carried out within GF_{4} (Table (Table1).1). Codes are termed linear because any linear combination of valid code sequences is also a valid code sequence: if _{
s1} and _{
s2} are source sequences with corresponding code sequences _{
c1}and _{
c2}, and _{
w1} and _{
w2} are elements of GF_{4} then _{
w1}_{
c1} + _{
w2}_{
c2}=(_{
w1}_{
s1} + _{
w2}_{
s2})*G* so *c*=_{
w1}_{
c1} + _{
w2}_{
c2} is a valid code sequence corresponding to the source sequence _{
w1}_{
s1} + _{
w2}_{
s2}.

Rather than expressing errors in terms of a specific color miscall, we consider types of errors defined by what happens when an element of GF_{4} is added to a call. For example, the error type ‘ + *β*’ transforms the color **
1
**(1, an element of

Each generator matrix has an associated parity check matrix *H* that can be used to determine whether a code sequence is valid. The parity check matrix uses a subset of the elements of observed sequence to call a putative decoded sequence and then calculates the expected value of the remaining ‘parity’ elements by treating the decoded sequence as true. The expected and observed parity sequences are then summed element-wise to create the parity check sequence. *H* is constructed so that the parity check sequence is the sequence-matrix product *xH*, where *x* is the observed sequence. By construction, the parity check of valid code sequence is a sequence of 0s; invalid code sequences have a non-zero parity check. When errors have occurred, the observed sequence can be expressed in terms of the code sequence for the source sequence and a sequence of error types *e*: *x*=*c* + *e*. Since the parity check of a valid code sequence is a sequence of zeros, the parity check of the observed sequence only depends on the sequence of errors and not the source sequence as *xH*=(*c* + *e*)*H*=*eH*. The value of *eH*=*xH* is termed the ‘syndrome’ of the error, a sequence in GF_{4} of length *n*−*k*that partitions the set of possible errors into equivalence classes.

Syndromes provide a simple and efficient method of decoding an observed sequence under the assumption that errors are rare and so the most plausible corrected sequence is the valid coding sequence which requires the fewest changes from the observed sequence. An error consisting of multiple changes may belong to the same equivalence class as one with fewer changes but the simpler error is the more likely and so is the best predictor of what error actually occurred. Before decoding begins, a table is constructed mapping every syndrome (*σ*) to the simplest possible sequence of error types that has it (_{
e
σ
}); this can be done by enumerating all single errors, followed by doublets, triplets, etc. until every syndrome has been observed at least once and all error types up to a given complexity have been considered. The syndrome table is a function of the code structure only and can be calculated once and distributed with the probe sets. To decode each observed sequence *x*, its syndrome *xH* is calculated and then located in the table to find the simplest sequence of error types _{
e
xH
} that could cause it. The sequence *x* + _{
e
xH
}is then a valid code sequence which can then be decoded. If there are several equally simple sequences of error types, then an error has been detected but the correction is ambiguous.

The ECC code is defined by the architecture shown in figure figure1.1. The encoding ‘machinery’ looks at windows of length five of the source sequence, moving along one element at a time, and performing the specified additions and multiplications. Two streams of symbols are emitted. For the first stream, corresponding to the standard color encoding, the first two elements of the window are added together. For the second stream, the ECC encoding, only every fifth symbol is recorded, a practice known as puncturing or perforating. This stream multiplies the second and fourth elements of the window by *β* and sums them with the first element. In terms of the SOLiD chemistry rounds, the color calls from each of the first five rounds correspond to every fifth element of the first stream with a different offset for each round and the calls from the final round correspond to the punctured second stream.

The calculation for both the first and second streams (*i*=1,2) can be expressed as the dot product *a*·_{
ρ
i
} where *a* is a row vector of the bases in the window and the _{
ρ
i
} describe the calculations to be done, with _{
ρ1}=11000 and _{
ρ2}=1*β*0*β*0. The _{
ρ
i
}are the ‘probe generators’ for the chemistry since they define the color of fluorophore that each probe has attached to it: the probe that interrogates the sequence *b* has color *b*·_{
ρ
i
}.

The architecture of the ECC code imposes the block structure shown in figure figure22 on the source sequence. The read is partitioned into blocks of length five, each of which can be uniquely recovered from the indicated five elements of the encoded sequence. The remaining elements of the encoded sequence each span two blocks and are in effect parity colors that can be used to detect the presence of errors. Ignoring the parity colors, the generator for each block is the invertible matrix

$${G}_{\text{Block}}=\left(\begin{array}{c}10001\\ 1100\beta \\ 01100\\ 0011\\ 00010\end{array}\right)\phantom{\rule{1em}{0ex}}{G}_{\text{Block}}^{-1}=\left(\begin{array}{c}01111\\ \beta \beta \alpha \alpha \alpha \\ \beta \beta \beta \alpha \alpha \\ 00001\\ 11111\end{array}\right)$$

(1)

which can be used to freely convert between a sequence of five nucleotides and its encoding. For example, the nucleotide sequence ACGAT (01*α*0*β*) has the color encoding **
13233
**(1

After reordering the encoded sequence appropriately, the generator for the full code, _{
GECC}, can be expressed in terms of the generators for each of the blocks and an additional column for each of the parity colors:

$$\phantom{\rule{-12.0pt}{0ex}}{G}_{\text{ECC}}=\left(\left(\begin{array}{c}{G}_{\text{Block}}\phantom{\rule{1em}{0ex}}0\phantom{\rule{24.18483pt}{0ex}}\dots \\ \phantom{\rule{1em}{0ex}}\phantom{\rule{1em}{0ex}}0\phantom{\rule{1em}{0ex}}\phantom{\rule{1em}{0ex}}{G}_{\text{Block}}\phantom{\rule{2em}{0ex}}0\phantom{\rule{14.22636pt}{0ex}}\dots \\ \phantom{\rule{1em}{0ex}}\phantom{\rule{1em}{0ex}}\vdots \phantom{\rule{25.60747pt}{0ex}}0\phantom{\rule{19.91692pt}{0ex}}{G}_{\text{Block}}\phantom{\rule{2.84526pt}{0ex}}\ddots \\ \phantom{\rule{41.25648pt}{0ex}}\vdots \phantom{\rule{29.87538pt}{0ex}}\ddots \phantom{\rule{8.53581pt}{0ex}}\ddots \end{array}\right)\right)\left(\left|\begin{array}{c}{u}_{5}\phantom{\rule{1em}{0ex}}0\phantom{\rule{1em}{0ex}}\phantom{\rule{1em}{0ex}}\dots \\ {u}_{1}\phantom{\rule{1em}{0ex}}{u}_{5}\phantom{\rule{1em}{0ex}}\ddots \\ 0\phantom{\rule{1em}{0ex}}{u}_{1}\phantom{\rule{1em}{0ex}}\ddots \\ \vdots \phantom{\rule{1em}{0ex}}\ddots \phantom{\rule{1em}{0ex}}\ddots \end{array}\right)\right)=\left({G}^{\ast}|P\right)$$

(2)

where _{
u
i
}is a column vector with five elements consisting of 0s except for a 1 in the ^{
ith}position, with *G*^{*} and *P* being defined appropriately. The dimensions of _{
GECC} are *k*×*n*, where *k* is the length of the read (source sequence) and *n* the total number of color calls produced in both the two-base-encoding and ECC chemistry rounds.

The parity-check matrix, _{
HECC}, corresponding to generator _{
GECC}, is

$${H}_{\mathrm{ECC}}=\left(\begin{array}{c}{G}^{\ast -1}\phantom{\rule{1em}{0ex}}\phantom{\rule{1em}{0ex}}0\\ \phantom{\rule{1em}{0ex}}0\phantom{\rule{1em}{0ex}}{I}_{n-k}\end{array}\right)\left(\begin{array}{c}P\\ {I}_{n-k}\end{array}\right)$$

(3)

where _{
I
m
} is the *m*×*m*identity matrix. By considering the action of this parity-check matrix on an encoded sequence, the calculation of the syndrome can be given concrete form: the first matrix of the factorised form of _{
HECC} takes the observed sequence and inverts it block by block to get a putative nucleotide decoding, with the values of the parity colors preserved. The second matrix calculates the parity colors for the putative decoding and adds them element-wise to the parity colors actually observed. The resulting sequence of length *n*−*k* is the syndrome. If the syndrome is composed entirely of 0s, i.e. the parity-check has been passed, then the code sequence and its putative nucleotide decoding are valid. If the syndrome has non-zero entries then an error has been detected.

When an error is known to have occurred but is ambiguous, it may be mistakenly ‘corrected’ by applying the wrong error type. The equivalence class contains the possible simple error types that could have caused the observed syndrome but only one of them is the one that actually occurred; applying any to the observed sequence will result in a valid code sequence. We can determine the pattern of nucleotide errors that mistaken correction will result in: if the observed sequence with (unknown) error _{
e1} is *c* + _{
e1} and the correction _{
e2}≠_{
e1} is applied, then converting back to a nucleotide sequence using the inverse of the block generator results in $(c+{e}_{1}+{e}_{2}){G}^{-1}$. The difference between the nucleotide translation of the corrected sequence and the correct nucleotide sequence is $({e}_{1}+{e}_{2}){G}^{-1}$ — the pattern of error induced. Note that the pattern does not depend on the correct nucleotide sequence, but only on the two changes being considered. By examining all possible combination of error types belonging to an equivalence class, the full set of patterns that may occur can be determined. The pattern of error may be a single base change, or a more complicated multi-base change.

The theory described examines the worst case where an error can occur anywhere and there is no additional information about which site it is likely to have affected. Real-life performance of the code depends on additional factors. Firstly, the distribution of where errors occur is not uniform, depending for example on the chemical and physical characteristics of the sequencing process, and may not even be independent between positions; the performance of a code may change depending on the error profile. Secondly, but related, the sequencing platform provides quality information in the form of Phred scores [9] that can be used to help locate the position where an error occurred. Values quantifying the probability that a given call is wrong are known as ‘soft information’, compared to the ‘hard information’ of the observed sequence not being a valid encoding.

A convenient way to deal with these extra complications is to simulate encoded sequence under a realistic model of how errors occur and then decode using dynamic programming, on a ‘trellis’ graph that defines all possible decodings and their relative probabilities, to find the most probable call for each position of the decoded sequence [3]. In practice, we need to consider three classes of differences: those due to variants between sequence under study and the reference it is mapped against, those caused by mutations in the original sequence due to polymerase errors during sample preparation (‘generalised error’) and errors made calling the encoded sequence. The first type of difference is of interest and will affect many reads mapping to a single location. Of the remaining two types of difference, the former occurs before the sequence is encoded, so encoding provides no protection and limits the maximum accuracy of the platform; errors of the latter class may be correctable.

In the absence of empirical data for how the distribution of calls and miscalls changes over probes and rounds, and how errors are correlated between positions, we have assumed that errors occur independently for every element of the code sequence and errors are picked uniformly from the three possibilities. The probability of an error for a particular round and cycle of ligation is taken to be equivalent to the quality score from a read sampled at random from a real set of data, implicitly assuming that the error characteristics for alternative probe sets (which depend on the ligation efficiencies of the different pentamers) will be the same as for the ECC probe set. The simulation scheme is as follows:

1. Sample a fragment from genome (base-space).

2. Mutate bases of fragment independently with equal probability (generalised error).

3. Encode mutated fragment (convert to code-space).

4. Sample qualities from a set of real data.

5. Mutate the encoded sequence with probabilities defined by quality values.

This scheme outlined has an error model similar to that implicitly assumed when analysing real data since information about both alternative calls and correlation between calls has already been lost during processing into a color-space sequence with a single quality value for each position. The scheme does not simulate the occurrence of insertions and deletions but these are relatively rare compared to substitutions and are most likely to be due to errors introduced during sample preparation rather than calling errors.

If a read is error-free then it can be decoded unambiguously and the calls from the two-base-encoding chemistry and ECC codes will agree. When an error occurs in any of the two-base-encoding chemistry rounds, it translates into multiple base miscalls. The structure of the ECC code allows such errors to be detected, recovered from, and, in certain circumstances, corrected. The syndrome equivalence classes are defined by the types of error that can occur and so, by examining them, we can classify the cases where errors can be corrected unambiguously and those where additional information is needed to resolve the ambiguity.

Since the elements of the syndrome consist solely of the summation of the observed and expected parity colors, there is a one-to-one correspondence between them and parity colors. An error in a block can only affect two elements of the syndrome, those corresponding to the two parity colors that overlap the block’s first and last elements. We refer to these as the upstream and downstream syndromes, respectively, so it is sufficient to concentrate on how errors occur in only one block. All statements we make about the error correcting properties of the encoding are on a per-block basis, so a code that can correct one error per block can correct multiple errors if spread between blocks. The final block only has a upstream syndrome and so has more limited error correction.

The value of the syndromes for all possible single-color errors that could occur in a block or its parity colors are shown in Table Table2.2. For example, an error of +1 in the second color produces the syndrome *βα*, identical to that produced by an error of +1 in the third position. If a syndrome is unique (for example, syndrome *ββ* arises only from error + *β* in position _{
c5}) then, assuming only a single error has occurred in that block or parity color, that error can be determined and so corrected. Note that while errors in parity color _{
p−}, overlapping a block and the previous one, appear to have unique syndromes, this parity color is also _{
p + } for the previous block and so the syndrome can actually be caused by multiple different errors.

The syndrome equivalence classes show the types of single-color error that cannot be disambiguated without additional information; a error has been detected but is not correctable. For example, the syndromes 0*β*, 0*α* and 01 can be generated by single errors at _{
c1}, _{
c4} or _{
p + }, and so errors at these positions cannot be distinguished. The equivalence classes define the possible simple changes to the observed sequence that will produce a valid sequence that can be decoded into a string of bases, only one of which produces the correct sequence. When an error is wrongly corrected, the code sequence is changed in two places, the original error and the correction; the structure of the code ensures that the changes should be complementary (both ‘+1’ or both ‘ + *α*’, for example).

Using the inverse of the block generator matrix, the pattern of changes that are induced in base-space by miscorrections to the observed sequence can be derived. If errors occur and are miscorrected, such that the difference between the correct and observed values of the data colors is *d*, then the pattern of differences *p* induced in base-space is given by $p=d{G}_{\text{Block}}^{-1}$. For example, an error of type + *α*at the second position might be erroneously corrected by an error of type + *α* at the third position, so the differences are 0*αα*00 and the pattern induced in base-space is 00*α*00 (the sum of the second and third rows of ${G}_{\text{Block}}^{-1}$ multiplied by *α*). If this occurred to the nucleotide sequence ATGCG then the sequence ATACG would result.

All patterns induced by single-color errors are listed in Table Table3;3; for example, an error of type + *α* at the first position may be wrongly corrected at either the fourth position or the parity color, leading to the triple error 0*ααα*0 or the quadruple error 0*αααα*, respectively. Note that no pattern ever affects the first position of the block; the structure of the matrix ${G}_{\text{Block}}^{-1}$ shows that this position can only be changed by errors in the second, third or fifth positions: single-color errors at the fifth position can be always be unambiguously corrected, and errors at the second or third positions result in either corrections or changes that cancel at the first position.

One notable feature of these more complex errors is that the error type is the same at all affected positions, a property that might help distinguish sequencing errors from genuine variants if the reads are later mapped to a reference. By adding the mapped read to the reference in GF_{4}, the pattern should be evident if it was due to simple miscall. If the pattern is not evident, the differences are either due to sequence variants or multiple miscalls.

While the consideration of syndromes provides useful information about a code’s properties and syndrome decoding is computationally efficient, it is not a replacement for probabilistic methods of decoding since the latter incorporates the quality information about each call and can use it to make better decisions about correction. However, syndrome decoding techniques may still be of use in conjunction with the more computationally expensive probabilistic methods since the syndrome provides a quick test of whether the observed sequence is valid (no correction needed). Syndrome equivalence classes could also be used to restrict the paths through a trellis to a plausible set, providing a heuristic to speed up the dynamic programming algorithm to find the most probable decoding.

We have shown the type of errors that the ECC code can correct but have not yet addressed whether it is optimal. Before examining specific alternative codes, it is interesting to look at what can possibly be achieved and there are several mathematical results that restrict the performance of any code. Firstly the Hamming [10], Johnson [11] and Singleton [12] bounds place an upper limit on the number of errors that a code can hope to detect or correct but codes meeting these bounds may not exist; the Gilbert–Varshamov bound [13,14] is a lower limit on the performance of the best code that does exist.

For reads of 50 bases encoded into 60 letters (as with the ECC code), the lower bound guarantees that a code exists that can detect any two errors and correct any single error. The upper bounds show that no code can guarantee to correct more than three errors. For reads of length 75 bases encoded into 90 letters, then a code exists that can detect and correct any two errors but no code can guarantee to detect and correct more than four errors. There is no guarantee that a convolutional code can meet this bound and the two most common classes of codes that come close to attaining these bounds, Turbo codes [15] and Low-Density Parity-Check codes [16], require long-range dependencies between positions in the sequence and so cannot be implemented in any plausible sequencing chemistry.

Examining the syndromes in Table Table2,2, we notice that, despite many possible single errors having ambiguous syndromes, not all syndromes are present: the three syndromes *αβ*, *β*1 and 1*α* do not occur. The missing syndromes are not truly unused, being generated by multiple errors, but the failure to use them to distinguish single errors suggests that there may exist alternative codes with a greater ability to correct single calling errors. The advantage would derive from using the extra syndromes to partition single-color errors more evenly into equivalence classes. Such alternative codes can be analysed using the same techniques as the ECC code.

Rather than consider all possible convolutional codes, we will focus our attention on a subset that satisfy some reasonable restrictions inspired by the reality of the SOLiD platform. It is desirable that any new chemistry would be backwards compatible with the two-base-encoding chemistry, meaning that the first five rounds of sequencing must use an unaltered two-base-encoding probe set. This backwards compatibility restriction is equivalent to requiring that a new code must have an unpunctured color stream.

While the number of rounds and probe sets could be varied, and probes of differing lengths could be used, to remain comparable to the current ECC chemistry we will focus only on chemistries where a single additional round (and so only one additional probe set) will be used and the probes remain based on pentamers. Analogous to the code structure shown in figure figure1,1, alternative codes that can be implemented with a single additional round are punctured so only every fifth element of the second stream is produced.

By redefining the boundaries of the block structure, the number of different alternative codes that need to be considered can be further reduced: a code whose probe generator starts with one or more 0s is identical to one starting at the first non-zero element with the tail padded with zeros. The probe generator of any code that starts with *α* or *β* can be written as *αW* or *βW*, where *W * is the probe generator of a code starting with 1, and the linearity of convolutional codes ensures that the two codes have identical sets of code words: although the mapping between nucleotide sequence and encoded sequence will differ, the error correcting characteristics will be the same.

The block generator for alternative codes that satisfies all the restrictions, and its inverse, can be written as

$${G}_{\mathrm{alt}}=\left(\begin{array}{c}1000{p}_{1}\\ 1100{p}_{2}\\ 0110{p}_{3}\\ 0011{p}_{4}\\ 0001{p}_{5}\end{array}\right){G}_{\mathrm{alt}}^{-1}=\left(\begin{array}{c}1000{x}_{1}{y}^{-1}\\ 0100{x}_{2}{y}^{-1}\\ 0010{x}_{3}{y}^{-1}\\ 0001{x}_{4}{y}^{-1}\\ 0000{y}^{-1}\end{array}\right)L$$

(4)

where _{
p1}_{
p2}_{
p3}_{
p4}_{
p5} is the generator for the second set of probes, *L* is the matrix whose upper triangle consists of 0 and whose diagonal and lower triangular elements are all 1, *x*=*Lp* and *y*=_{
x5}. The ECC code has the probe generator _{
p1}_{
p2}_{
p3}_{
p4}_{
p5}=1*β*0*β*0. The inverse generator only exists when *y* is invertible (i.e. *y*≠0); when *y* is not invertible, blocks of colors cannot be individually inverted and the syndrome analysis is not applicable. Due to the structure of *L*, requiring *y* to be invertible is the same as the sum of the elements of the probe generator not being zero.

One further restriction will be placed on the probe generator of alternative codes: the ECC probe generator contains 0 at its fifth position and this is probably a consequence how accurately pentamers with differing final bases can be ligated to the sequence. Codes whose generators use the final position might theoretically have better error correction properties but the increased rate of calling errors, due to incorrect probes being ligated, may cancel any improvement their use may offer; consequently, we will require _{
p5}=0.

There are 48 probe generators satisfying all the restrictions and the invertibility condition, of which the syndromes and equivalence class for two interesting alternatives are shown in Table Table4.4. The first code has generator _{
p1}_{
p2}_{
p3}_{
p4}_{
p5}=10*β*00 and has similar equivalence classes to the ECC code but only uses the first three positions of the generator. While the set of syndromes for single-color errors is also incomplete (syndromes 1*β*, *α*1 and *βα* are unused) and thus the error correcting properties will be similar to the ECC code, the shorter length of the generator means that calculations on the trellis, to determine the most probable decoding, can be carried out four times quicker.

The second alternative code shown in Table Table4,4, with probe generator 1*β*010, uses all possible syndromes and potentially has better error correcting properties than the ECC code. Comparing the equivalence classes of the new code to those for the ECC code, the new code uses the extra syndromes to split the largest class into two. Whereas the ECC code is unable to distinguish errors at the first, fourth or parity positions, the new code can unambiguously correct errors at the first position and the ambiguity of fourth and parity position errors is reduced.

Table Table55 shows the error patterns induced by single-color errors for the two alternative codes considered. Note the reduced number of base-space errors relative to the ECC code (Table (Table33).

The theory described suggests that the code with probe generator 1*β*010 is more powerful than the ECC code but this does not necessarily mean that it performs better in practice since actual performance will depend on the distribution of different types of error and at which positions they occur. To help quantify the difference in performance between codes, they were compared on artificial data, simulated so that it had an error profile similar to real data but for which the original sequence of bases is known, the error profile being estimated by mapping to a SNP-corrected genome.

One million fragments were sampled uniformly from the positive strand of the genome of *E. coli* DH10b with qualities being sampled from a real sequencing run of the same genome. The probability of generalised error was set to be equivalent to _{
Q34}, close to observed values for prepared samples. Three sets of reads were produced, using different codes on the same set of fragments to generate the ECC information, and sequence was called into both base-space and color-space using the Maximum A Posteriori (MAP) criterion. Reads were then mapped to an appropriately encoded reference using the BWA aligner [17] with an edit distance of five. Results, in terms of the total proportion of reads mapping and the proportion mapping with a given number of errors, are shown in Table Table66.

Using the ECC information (probe generator 1*β*0*β*0) to help call reads makes a considerable improvement in both color-space and base-space. Without any correction, 77.1% of simulated reads map to the reference in color-space and only 38.4% of these are perfect, with a further 16.7% having one error. After correction, 48.6% of reads are perfect, with 10.2% containing one error. In base-space, the number of mapped reads increases from 47.2% to 64.3%. This large increase is due to correcting single-color errors that would otherwise induce multiple base errors and prevent the read from being mapped using the ‘five differences or fewer’ criterion.

All three codes perform better than uncorrected sequence in both color-space and base-space. There was little difference between their performance in absolute terms, although the code generated by 1*β*010 produced more error-free reads than the other two. This small absolute difference disguises a larger increase in the proportion of corrected reads: under the 1*β*0*β*0 code, 10.2% of reads were corrected to being perfect compared to 11.4% for the 1*β*010 code, an 11.8% relative improvement even though the absolute improvement is only 1.2%. The 10*β*00 code produces more mappable base-space sequence than either of the other codes and the reason for this may be in the pattern of errors in base-space that single-color errors make: comparing the patterns in Tables Tables33 and and55 shows that, for the two alternative codes, single-color errors predominantly cause a single base error when wrongfully corrected, rather than more complex errors, and so there are fewer base-space errors in total.

While the code generated by 1*β*010 does perform better than the ECC code, the improvement is not especially dramatic despite the syndrome equivalence classes suggesting superior error-correcting properties. The decoding algorithm uses soft information as well as the hard information from color calls when determining the most probable base at each position of decoded sequence and this is a possible explanation for the small difference between the performance of the codes. The equivalence classes narrow down the possible errors but, rather than randomly picking the correction, MAP decoding uses the quality information to guide the choice and the right correction might be picked the majority of the time even without this extra assistance.

The addition of the Exact Call Chemistry to the SOLiD platform enables many sequencing errors to be detected that would otherwise would pass unnoticed; this in itself provides useful information about the accuracy of reads. Without using quality information, the ability of the Exact Call Chemistry to correct sequencing errors is limited but the number of possible options can often be drastically reduced. The quality of the calls for the encoded sequence can then be used to choose between the options for correction, leading to genuine ability to correct sequencing mistakes. The five-base length of the block places a limit on how frequently errors can occur before the encoding can no longer offer protection. In our simulations, the number of perfect color-space reads increases by 27% when error correction is performed, the majority of these corrections being single errors that might otherwise degrade the base-space translation of the read. The error correction capability offered by the ECC results in measurable gains for the SOLiD platform but there is a trade-off between the extra time and expense and the improvements possible through increasing coverage using additional sequencing runs.

The complex triple and quadruple errors that can be induced in the final nucleotide reads by miscorrection of the observed sequence are not well represented by the Phred error model [9], where each site is assigned an individual quality independent of other sites. This may have consequences for downstream analyses that assume the Phred model is a good representation of the probability that a particular site is in error. The patterns of error induced by the largest equivalence class of the ECC code may allow some sequencing errors to be distinguished from genuine variants after mapping to a nucleotide reference. The power of this approach is unlikely to be good and so it will not be an adequate replacement for mapping and variant calling using a more appropriately encoded reference. One possibility would be to encode the reference using the ECC code and match directly against that, using all the available information but making variant calling difficult due to the complex structure of the data. A simpler alternative would be to decode into two-base-encoding colors, using the extra ECC calls to correct the color calls. The corrected color reads can then be mapped against a color-encoded reference using the many tools already developed.

The variation in the ability of the ECC to correct errors at different positions in each block suggests a simple improvement to the platform that would enable it to recover from problematic rounds. Consider, for example, that one of the initial five rounds has experienced some form of gross failure, perhaps due to a bad wash or incomplete melting of the previous primer and sequence from the template, so that every cycle in that round is of poor quality. The priming of the final round could be adjusted to start at a different position of each block, chosen to maximise the chance of correcting previous errors. For the ECC code, the priming would be chosen to ensure that calls from the bad round coincide with positions two or three of the final round (the equivalence class with two elements); the alternative code generated by 1*β*010 would be primed so that the errors coincide with the first position and correction could be guaranteed. This technique could also help recover from transient errors, like bubbles in the buffer preventing calls being made for a large number of clusters on a particular cycle.

The alternative codes that we describe have equal or superior error correction ability to that of the ECC but the creation of a new probe set is a considerable investment and a more thorough search of alternatives codes should be undertaken before the expense is incurred. All the alternative codes considered satisfy a number of restrictions, several of which could be relaxed to improve the error correction properties. Firstly, more rounds could be used, slowing the sequencing process down but providing more redundancy with which to correct errors. Secondly, the architecture of the encoder was constrained to be backwards compatible with the two-base-encoding sequencing chemistry, completely defining one unpunctured stream. A completely new chemistry could vary both probe sets and also change the puncturing matrix, allowing much more flexibility over the design of the code architecture and potentially creating codes that are capable of unambiguously correcting multiple errors.

While many sequencing errors can be corrected, their occurrence is non-uniform, being more frequent in the later cycles of each round. This leads to a tendency for the poorest reads to contain multiple errors in close proximity. Such bursts of errors cannot be successfully corrected, so the advantage of the ECC is limited to generally high quality reads containing a few sparsely distributed errors. Perhaps the major advantage of the new chemistry is that the sequencing platform can produce reliable nucleotide sequence, without the possibility of a single error causing a catastrophic decoding failure, which allows the reads produced to be analysed with the wealth of tools available that assume nucleotide sequence.

Software reimplementing the decoding algorithm for the two-base- and four-base- encodings (SOLiD ECC), as well as the alternative encodings described, on a trellis to find both the maximum likelihood (Viterbi decoding) and maximum a posteriori [3] (forwards/backwards decoding) nucleotide sequence is available at http://www.ebi.ac.uk/goldman-srv/solid/, distributed under version 3 of the GNU General Public Licence, as is software to simulate two- and four-base encoded reads and some utility functions to manipulate convolutional codes in GF_{4}. This software is provided solely for the purposes of reproducibility.

This work was supported in part by Wellcome Trust Technology Development grant WT088151MA and a grant to the EBI from Life Technologies Corporation. Life Technologies Corporation had no input into the development of the study, article preparation or decision to publish. No other competing interests are declared.

The study was conceived and planned by both authors. The analysis of the Exact Call Chemistry coding was done by TM, who also drafted the manuscript. Both authors read, edited and approved the final manuscript.

The authors give their thanks to Ewan Birney for suggesting a study of the ECC, and to Marcin Sikora and Alan Blanchard of Life Technologies Corporation (Foster City, CA) who did the original work on the application of convolutional codes to sequencing. TM would like to thank the staff at Life Technologies Corporation for their hospitality during a short visit. The real sequencing data used for the analyses in this article was provided by Life Technologies Corporation. SOLiD^{®;} is a registered trademark of Life Technologies Corporation.

- Metzker ML. Sequencing technologies – the next generation. Nat Rev Genet. 2010;11:31–46. [PubMed]
- Breu H. In: A theoretical understanding of 2 base color codes and its application to annotation, error detection, and error correction. White paper, Life Technologies 2010, editor. [ http://www3.appliedbiosystems.com/cms/groups/mcb_marketing/documents/generaldocuments/cms_058265.pdf. [Accessed: 7 Dec. 2011].
- White paper, Life Technologies 2010, editor. SOLiD System accuracy with Exact Call Chemistry module. [ http://www3.appliedbiosystems.com/cms/groups/global_marketing_group/documents/generaldocuments/cms_091372.pdf. [Accessed: 7 Dec. 2011].
- Erlich Y, Mitra PP, de la Bastide, McCombie WR, Hannon GJ. Alta-Cyclic: a self-optimizing base caller for next-generation sequencing. Nat Methods. 2008;5:679–682. [PMC free article] [PubMed]
- Yuen JH, Vo QD. In search of a 2-dB coding gain. TDA Progress Report 42-83, Jet Propulsion Laboratory, Volume July-September 1985. 1985. pp. 26–33. http://ipnpr.jpl.nasa.gov/progress_report/42-83/83C.PDF. [Accessed: 7 Dec. 2011]
- Viterbi AJ. Convolutional codes and their performance in communication systems. IEEE Trans Commun Technol. 1971;19:751–772.
- MacKay D. Information Theory, Inference, and Learning Algorithms. Cambridge University Press, Cambridge; 2003.
- Cohn PM. Algebra, Volume 1. Wiley-Blackwell, Chichester; 1982.
- Ewing B, Green P. Base-calling of automated sequencer traces using phred. II. Error probabilities. Genome Res. 1998;8:186–194. [PubMed]
- Hamming RW. Error detecting and error correcting codes. Bell Syst Technl J. 1950;29:147–160.
- Johnson SM. A new upper bound for error-correcting codes. IRE Trans Inf Theory. 1962;8:203–207.
- Singleton R. Maximum distance q-nary codes. IEEE Trans Inf Theory. 1964;10:116–118.
- Gilbert EN. A comparison of signalling alphabets. Bell Syst Techn J. 1952;31:504–522.
- Varshamov RR. Estimate of the number of signals in error correcting codes. Dokl Acad Nauk SSSR. 1957;117:739–741.
- Berrou C, Glavieux A, Thitimajshima P. IEEE International Conference on Communications, Volume 2, IEEE; 1993. Near Shannon limit error-correcting coding and decoding: turbo-codes; pp. 1064–1070.
- Gallager RG. Low-density parity-check codes. IRE Trans Inf Theory. 1962;8:21–27.
- Li H, Durbin R. Fast and accurate short read alignment with Burrows-Wheeler transform. Bioinformatics. 2009;25:1754–1760. [PMC free article] [PubMed]

Articles from BMC Bioinformatics are provided here courtesy of **BioMed Central**

PubMed Central Canada is a service of the Canadian Institutes of Health Research (CIHR) working in partnership with the National Research Council's national science library in cooperation with the National Center for Biotechnology Information at the U.S. National Library of Medicine(NCBI/NLM). It includes content provided to the PubMed Central International archive by participating publishers. |