Class Specialization
DPSearch
A dynamic programming algorithm for approximate string-matching with a user-definable scoring function.
 | | ||||||
DPSearch | |||||||
Include Headers
seqan/find.h
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.
Specialization of
Metafunctions
| Type of the object a given object depends on. (Pattern) | |
| Returns the needle type of a Pattern type. (Pattern) | |
| Returns the scoring scheme of an approximate searching algorithm. (Pattern) |
Functions
| Search for a Pattern in a Finder object. (Pattern) | |
| Search the begin of an approximate match. (Pattern) | |
| Score of the last match found by findBegin during approximate searching. | |
| Score of the last found match in approximate searching. | |
| The object a given object depends on. (Pattern) | |
| 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. (Pattern) | |
| 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. (Pattern) |
See Also
SeqAn - Sequence Analysis Library - www.seqan.de