Class Specialization
DPSearch
A dynamic programming algorithm for approximate string-matching with a user-definable scoring function.
DPSearch |
Specialization of
Functions
Search for a Pattern in a Finder object. (Pattern) | |
Score of the last found match in approximate searching. | |
Returns the needle of a Pattern object (not implemented for some online-algorithms). (Pattern) | |
Position of an iterator. (Pattern) | |
The minimal score a match must reach in approximate searching. | |
The scoring scheme used for finding or aligning. | |
Sets the needle of a Pattern object and optionally induces preprocessing. (Pattern) | |
Sets the minimal score a match must reach in approximate searching. | |
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