/*!
* @class DPSearchPattern
*
* @extends Pattern
*
* @headerfile <seqan/find.h>
*
* @brief A dynamic programming algorithm for approximate string-matching with a
* user-definable scoring function.
*
* @signature template <typename TNeedle, typename TScore[, typename TSpec[,
* typename TFindBeginPatternSpec]]> class Pattern<TNeedle,
* DPSearch<TScore[, TSpec[, TFindBeginPatternSpec]]> >;
*
* @tparam TScore The scoring function. Types: Score
* @tparam TNeedle The needle type. Types: String
*
* The algorithm is based on the Sellers/Needleman-Wunsch dynamic progamming
* algorithm. The <tt>Pattern</tt> object only contains the right-most column of
* the dynamic programming matrix.
*
* @fn DPSearchPattern#scoreLimit
*
* @headerfile <seqan/find.h>
*
* @brief The minimal score a match must reach in approximate searching.
*
* @signature TScoreValue scoreLimit(pattern);
*
* @param[in] pattern The DPSearchPattern to query.
*
* @return TScoreValue The score limit value.
*
* @fn DPSearchPattern#setSoreLimit
*
* @headerfile <seqan/find.h>
*
* @brief Set the minimal score a match must reach in approximate serach.
*
* @signature void setScoreLimit(pattern, limit);
*
* @param[in,out] pattern The DPSearchPattern to set the limit for.
* @param[in] limit The limit score value to set.
*
* @return TScoreValue The score limit value.
*
* @fn DPSearchPattern#getScore
*
* @headerfile <seqan/find.h>
*
* @brief Score of the last found match in approximate searching.
*
* @signature TScoreValue getScore(pattern);
*
* @param[in] pattern A DPSearchPattern that can be used for approximate
* searching.
*
* @return TScoreValue The score of the last match found using <tt>pattern</tt>.
* If no match was found then the vlaue is undefined.
*/