|
|
|
|
|
| Description |
Quality-aware alignments
Generally, quality data are ignored for alignment/pattern searching
like Smith-Waterman, Needleman-Wunsch, or BLAST(p|n|x). I believe
that accounting for quality will at the very least affect things like
BLAST statistics, and e.g. is crucial for good EST annotation using Blastx.
This module performs sequences alignments, takes quality values into
account.
See also http://bioinformatics.oxfordjournals.org/cgi/content/abstract/btn052v1.
|
|
| Synopsis |
|
| local_score :: QualMx Double -> (Double, Double) -> Sequence -> Sequence -> Double | | | local_align :: QualMx Double -> (Double, Double) -> Sequence -> Sequence -> (Double, EditList) | | | global_score :: QualMx Double -> (Double, Double) -> Sequence -> Sequence -> Double | | | global_align :: QualMx Double -> (Double, Double) -> Sequence -> Sequence -> (Double, EditList) | | | overlap_score :: QualMx Double -> (Double, Double) -> Sequence -> Sequence -> Double | | | overlap_align :: QualMx Double -> (Double, Double) -> Sequence -> Sequence -> (Double, EditList) | | | qualMx :: Qual -> Qual -> (Chr, Chr) -> Double | | | test :: IO () |
|
|
|
| Smith-Waterman
|
|
| Locally optimal alignment with affine gaps, i.e. best infix match.
|
|
|
| Calculate local edit distance (Smith-Waterman alignment score)
|
|
|
| Calculate local alignment (Smith-Waterman)
(can we replace uncurry max' with fst - a local alignment must always end on a subst, no?)
|
|
| Needleman-Wunsch
|
|
| Globally optimal alignment with affine gaps, the whole sequences are matched.
|
|
|
| Calculate global edit distance (Needleman-Wunsch alignment score)
|
|
|
| Calculate global alignment (Needleman-Wunsch)
|
|
| Overlapping alignment.
|
|
| The suffix of one sequence matches a prefix of another.
|
|
|
| Calucalte best overlap score, where gaps at the edges are free
The starting point is like for local score (0 cost for initial indels),
the result is the maximum anywhere in the last column or bottom row of the matrix.
|
|
|
| Calucalte best overlap score, where gaps at the edges are free
The starting point is like for local score (0 cost for initial indels),
the result is the maximum anywhere in the last column or bottom row of the matrix.
|
|
| Matrix construction
|
|
|
|
| Interactive testing of alignments
|
|
|
|
| Produced by Haddock version 2.4.2 |
