Name
Abstract | ||
|---|---|---|
In this paper we consider the problem of sequence alignment with quality scores. DNA sequences produced by a base-calling program (as part of sequencing) have quality scores which represent the confidence level for individual bases. However, previous sequence alignment algorithms do not consider such quality scores. To solve sequence alignment with quality scores, we first consider a more general problem where the input is weighted sequences which are sequences with probabilities that characters occur in each position. We propose a meaningful measure of an alignment of two weighted sequences and show that an optimal alignment in this measure can be found by dynamic programming. Sequence alignment with quality scores can be solved as a special case of the weighted sequence alignment problem. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1504/IJBRA.2009.022466 | IJBRA |
Keywords | Field | DocType |
bioinformatics,dna sequences,sequence alignment,dynamic programming | Sequence alignment,Dynamic programming,Alignment-free sequence analysis,Computer science,DNA sequencing,Bioinformatics,Multiple sequence alignment,Special case | Journal |
Volume | Issue | Citations |
5 | 1 | 2 |
PageRank | References | Authors |
0.41 | 12 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Joong Chae Na | 1 | 162 | 18.21 |
| Kangho Roh | 2 | 119 | 6.59 |
| Alberto Apostolico | 3 | 1441 | 182.20 |
| Kunsoo Park | 4 | 1396 | 171.00 |