| 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
Needle | Returns the needle type of a Pattern type. (Pattern)
Functions
find | Search for a Pattern in a Finder object. (Pattern)
getScore | Score of the last found match in approximate searching.
needle | Returns the needle of a Pattern object (not implemented for some online-algorithms). (Pattern)
position | Position of an iterator. (Pattern)
scoreLimit | The minimal score a match must reach in approximate searching.
scoringScheme | The scoring scheme used for finding or aligning.
setNeedle | Sets the needle of a Pattern object and optionally induces preprocessing. (Pattern)
setScoreLimit | Sets the minimal score a match must reach in approximate searching.
setScoringScheme | Sets 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