Error-correcting properties of the SOLiD Exact Call Chemistry

BMC Bioinformatics

Volumn 13, Issue 1, 2012, Pages

  Massingham, Tim ^a   Goldman, Nick ^a  

^a EUROPEAN BIOINFORMATICS INSTITUTE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COLOR SEQUENCE; ERROR-CORRECTING; LINEAR CODES; LOCALISED; NEXT-GENERATION SEQUENCING; NUCLEOTIDE SEQUENCES;

PROBES;

NUCLEOTIDES;

FLUORESCENT DYE;

ALGORITHM; ARTICLE; BIOLOGY; CHEMISTRY; COMPUTER PROGRAM; COMPUTER SIMULATION; DNA SEQUENCE; METHODOLOGY; NUCLEIC ACID PROBE;

ALGORITHMS; COMPUTATIONAL BIOLOGY; COMPUTER SIMULATION; FLUORESCENT DYES; NUCLEIC ACID PROBES; SEQUENCE ANALYSIS, DNA; SOFTWARE;

EID: 84862511467     PISSN: None     EISSN: 14712105     Source Type: Journal    
DOI: 10.1186/1471-2105-13-145     Document Type: Article

References (17)

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