Class Specialization
DPSearch
A dynamic programming algorithm for approximate string-matching with a user-definable scoring function.
Pattern
DPSearch
Pattern<TNeedle, DPSearch<TScore> >
Parameters
TNeedle
The needle type.
Types: String
TScore
The scoring function.
Types: Score
Specialization of
Pattern
Metafunctions
NeedleReturns the needle type of a Pattern type. (Pattern)
Functions
findSearch for a Pattern in a Finder object. (Pattern)
getScoreScore of the last found match in approximate searching.
needleReturns the needle of a Pattern object (not implemented for some online-algorithms). (Pattern)
positionPosition of an iterator. (Pattern)
scoreLimitThe minimal score a match must reach in approximate searching.
scoringSchemeThe scoring scheme used for finding or aligning.
setNeedleSets the needle of a Pattern object and optionally induces preprocessing. (Pattern)
setScoreLimitSets the minimal score a match must reach in approximate searching.
setScoringSchemeSets the scoring scheme used for finding or aligning.
Remarks
The algorithm is based on the Sellers/Needleman-Wunsch dynamic progamming algorithm. The Pattern object only contains the right-most column of the dynamic programming matrix.
SeqAn - Sequence Analysis Library - www.seqan.de