Hi Johannes,
if you only need the score without traceback then MeyersBitVector would be the choice. You can use the MeyersHirschberg version to get the traceback too. Note that both versions can only be applied to an edit distance cost scheme.
For more complex scoring schemes you need the NeedlemanWunsch algorithm. Have a look at our tutorial pages to find out all about the alignment algorithms in SeqAn:
http://trac.seqan.de/wiki/Tutorial/PairwiseSequenceAlignment.
The NeedlemanWunsch also works with the globalAlignmentScore function. In fact it computes no traceback at all, speeding up the algorithm a lot.
Kind regards,
René
On Aug 21, 2013, at 1:55 PM, Johannes Dröge <johdro@mpi-inf.mpg.de>
wrote:
Hi Manuel, --- René Rahn
Ph.D. Student
---------------------------------
Mail: rene.rahn@fu-berlin.de
Phone: +49 (0)30 838 75 277
---------------------------------
Algorithmic Bioinformatics (ABI)
Department of Computer Science
---------------------------------
Freie Universität Berlin
Takustraße 9
14195 Berlin
---------------------------------
|