Algorithms for sequence errors
Part 4. Bioinformatics
4.1. Genome Assembly and Sequencing
Basic Techniques and Approaches
Published Online: 15 JUL 2005
Copyright © 2005 John Wiley & Sons, Ltd
Encyclopedia of Genetics, Genomics, Proteomics and Bioinformatics
How to Cite
Andersson, B. and Tammi, M. T. 2005. Algorithms for sequence errors. Encyclopedia of Genetics, Genomics, Proteomics and Bioinformatics. 4:4.1:11.
- Published Online: 15 JUL 2005
There are many obvious reasons why we would want to use error-free DNA sequence data. For example, computer assembly of sequence fragments would be algorithmically much simpler and the cost of genome sequencing would be lower, since less sequence redundancy would be required. Unfortunately, we cannot get perfect data, but we can measure the accuracy of the sequence. The accuracy measures or error probabilities help us correct sequence data.
- Sanger method;
- dideoxy chain termination method;
- base calling;
- Phred base-calling program;