Tweet
Local alignment of two-base encoded DNA sequence.
Local alignment of two-base encoded DNA sequence.
BMC Bioinformatics. 2009 Jun 9;10:175.
Authors: Homer N, Merriman B, Nelson SF.
BACKGROUND: DNA sequence comparison is based on optimal local alignment of two sequences using a similarity score. However, some new DNA sequencing technologies do not directly measure the base sequence, but rather an encoded form, such as the two-base encoding considered here. In order to compare such data to a reference sequence, the data must be decoded into sequence. The decoding is deterministic, but the possibility of measurement errors requires searching among all possible error modes and resulting alignments to achieve an optimal balance of fewer errors versus greater sequence similarity. RESULTS: We present an extension of the standard dynamic programming method for local alignment, which simultaneously decodes the data and performs the alignment, maximizing a similarity score based on a weighted combination of errors and edits, and allowing an affine gap penalty. We also present simulations that demonstrate the performance characteristics of our two base encoded alignment method and contrast those with standard DNA sequence alignment under the same conditions. CONCLUSION: The new local alignment algorithm for two-base encoded data has substantial power to properly detect and correct measurement errors while identifying underlying sequence variants, and facilitating genome re-sequencing efforts based on this form of sequence data.
PMID: 19508732
------------------------------------------------------------------------------------
Note: I am an author of this paper.
This pertains to ABI SOLiD data and describes how in theory any aligner can find indels, SNPs, and errors in color space. Currently, only BFAST and SHRiMP have this implemented in some form.
BMC Bioinformatics. 2009 Jun 9;10:175.
Authors: Homer N, Merriman B, Nelson SF.
BACKGROUND: DNA sequence comparison is based on optimal local alignment of two sequences using a similarity score. However, some new DNA sequencing technologies do not directly measure the base sequence, but rather an encoded form, such as the two-base encoding considered here. In order to compare such data to a reference sequence, the data must be decoded into sequence. The decoding is deterministic, but the possibility of measurement errors requires searching among all possible error modes and resulting alignments to achieve an optimal balance of fewer errors versus greater sequence similarity. RESULTS: We present an extension of the standard dynamic programming method for local alignment, which simultaneously decodes the data and performs the alignment, maximizing a similarity score based on a weighted combination of errors and edits, and allowing an affine gap penalty. We also present simulations that demonstrate the performance characteristics of our two base encoded alignment method and contrast those with standard DNA sequence alignment under the same conditions. CONCLUSION: The new local alignment algorithm for two-base encoded data has substantial power to properly detect and correct measurement errors while identifying underlying sequence variants, and facilitating genome re-sequencing efforts based on this form of sequence data.
PMID: 19508732
------------------------------------------------------------------------------------
Note: I am an author of this paper.
This pertains to ABI SOLiD data and describes how in theory any aligner can find indels, SNPs, and errors in color space. Currently, only BFAST and SHRiMP have this implemented in some form.