| Class Pattern Holds the needle and preprocessing data (depends on algorithm).
Pattern
AbndmAlgo | AhoCorasick | Bfam | BndmAlgo | DPSearch | HammingSimpleFinder
Bfam<Oracle>
Bfam<Trie>
Horspool | MultiBfam | MultipleShiftAnd | Myers | Pex | SetHorspool
MultiBfam<Oracle>
Hierarchical
NonHierarchical
ShiftAnd | ShiftOr | Simple Finder | Swift | WildShiftAnd | WuManber
SwiftLocal
SwiftSemiGlobal
Pattern<TNeedle[, TSpec]> Include Headers seqan/find.h Parameters
TSpec | The online-algorithm to search with. Types: AbndmAlgo, AhoCorasick, Bfam, BndmAlgo, HammingSimpleFinder, Horspool, MultiBfam, MultipleShiftAnd, Myers, Pex, Score, SetHorspool, ShiftAnd, ShiftOr, Simple Finder, Swift, WildShiftAnd, WuManber Default: The result of DefaultPattern Remarks: Leave empty for index-based pattern matching (see Index).
TNeedle | The needle type. Types: String
Remarks If TNeedle is a set of strings, then position(pattern) returns the index of the currently matching needle. Specializations
AbndmAlgo | Approximate Backward Nondeterministic Dawg Matching algorithm. Approximate string matching using bit parallelism.
AhoCorasick | Multiple exact string matching using Aho-Corasick.
Bfam | Backward Factor Automaton Matching algorithm.
BndmAlgo | Backward Nondeterministic Dawg Matching algorithm. Exact string matching using bit parallelism.
DPSearch | A dynamic programming algorithm for approximate string-matching with a user-definable scoring function.
HammingSimpleFinder | A brute force online searching algorithm for approximate string matching with hamming distance.
Horspool | Exact string matching using Horspool's algorithm (1980).
MultiBfam | Multi-Pattern Backward Factor Automaton Matching.
MultipleShiftAnd | Multiple exact string matching using bit parallelism. The total size of the patterns should fit into a computer word.
Myers | Provides fast approximate searching of one string in another using Myer's fast bit-parallel algorithm with application of the Ukkonen-trick.
Pex | Provides a fast approximate string matching filter that splits the needle into several pieces that are searched with a multiple exact string matching algorithm and later verified.
SetHorspool | Multiple exact string matching using set horspool algorithm.
ShiftAnd | Exact string matching using bit parallelism. The Shift-And algorithm is applicable to search small patterns in texts using a small alphabet.
ShiftOr | Exact string matching using bit parallelism. The Shift-Or algorithm is applicable to search small patterns in texts using a small alphabet.
Simple Finder | A brute force online searching algorithm.
Swift | Provides a fast filter alogrithm that guarantees to find all regions overlapping with potential ε-matches. An ε-match is a matching region of minimal length and an error rate of at most ε.
WildShiftAnd | Exact string matching with wildcards using bit parallelism. The Shift-And algorithm is applicable to search small patterns in texts using a small alphabet.
WuManber | Online-algorithm for multi-pattern search.
Metafunctions
Host | Type of the object a given object depends on.
Needle | Returns the needle type of a Pattern type.
ScoringScheme | Returns the scoring scheme of an approximate searching algorithm.
Functions
find | Search for a Pattern in a Finder object.
findBegin | Search the begin of an approximate match.
host | The object a given object depends on.
needle | Returns the needle of a Pattern object (not implemented for some online-algorithms).
position | Position of an iterator.
scoringScheme | The scoring scheme used for finding or aligning.
setNeedle | Sets the needle of a Pattern object and optionally induces preprocessing.
setScoringScheme | Sets the scoring scheme used for finding or aligning.
SeqAn - Sequence Analysis Library - www.seqan.de

Page built @2012/03/14 16:34:45