Specializations

Specializations refine Class templates using Template Subclassing.

Aggregates

Stores two arbitrary objects. Saves memory by packing bits with bit fields. | |

A plain fixed-length string. Saves memory by packing bits. | |

Stores two arbitrary objects. Saves memory by disabling memory alignment. | |

Stores three arbitrary objects. Saves memory by disabling memory alignment. |

Alignments

Stores gaps anchors of the first characters behind gaps. | |

Stores gaps sizes in an array. | |

A type for ungapped, pairwise segment matches. | |

A type for ungapped, pairwise segment matches that may be in reverse orientation. | |

Stores gaps in a Sumlist. |

Allocators

Allocator that pools one or more consecutive memory blocks of a specific size. | |

Allocator that pools memory blocks. | |

General purpose allocator. | |

Allocator that pools memory blocks of specific size. |

Alphabets

Iupac code for amino acids. | |

Alphabet for DNA. | |

Alphabet for DNA including 'N' character. | |

Alphabet for DNA plus phred quality including 'N' character. | |

Alphabet for DNA plus phred quality. | |

A finite alphabet of a fixed size. | |

Iupac code for DNA. | |

Alphabet for RNA. | |

Alphabet for RNA including 'N' character. | |

Trace back values. |

Blast

Stores only the basic pieces of information delivered with an alignment in a Blast report. | |

For BlastN Blast reports. | |

For BlastP Blast reports. | |

Stores all pieces of information delivered with an alignment in a Blast report. | |

Hit iterator for BlastReport. | |

Hsp iterator for BlastHit. | |

BlastReport specialization. Parses a Blast report and stores all hits and HSPs. | |

BlastReport specialization that works on a file stream (parses hits/HSPs when iterating over them). |

Chaining

Data structure which represents a seed of multiple sequences. | |

Scoring scheme for chaining that uses a special method for scoring the gaps between two fragments. | |

Scoring scheme for chaining that computes gap scores using manhattan distance. | |

Scoring scheme for chaining that set gap scores to 0 |

Files

File structure supporting synchronous and asynchronous input/output access. | |

Splits a large file into a chain of smaller files. | |

Read sequence data from file. | |

Stripes a file across multiple files. | |

File structure supporting synchronous input/output access. |

Graph

Adjacency iterator for Graph. | |

An alignment graph. | |

An Automaton has directed edges, labeled with input symbols, and a distinct start state, called root. The input symbols require the use of a third parameter: The alphabet of the input symbols. | |

Breath-first search iterator for Graph. | |

Id Manager that just counts the number of ids in use. | |

Depth-first search iterator for Graph. | |

A directed graph that stores the edges in an adjacency list. | |

Edge iterator for Graph. | |

An Hmm is a directed graph with edges labeled with transition probabilities and emission profiles for each vertex. Vertices correspond to states in an HMM. | |

A factor oracle. | |

Out-edge iterator for Graph. | |

A Tree has a distinct root and directed edges. The source vertex of each edge is the parent vertex, the target vertex of each edge is the child. Trees provide fast access to child vertices and the parent. | |

A keyword trie. | |

An undirected graph that stores the edges in an adjacency list. | |

Vertex iterator for Graph. | |

A special automaton that stores words instead of single characters along its edges. |

Holders

Holder that can be empty, dependent, or owner. |

Index

Iterator for an efficient postorder depth-first search in a suffix tree. | |

A fixed gapped shape. | |

A variable gapped shape. | |

The Deferred Frequency Index (see Weese and Schulz, "Efficient string mining under constraints via the deferred frequency index"). | |

An index based on an enhanced suffix array. | |

An index based on an array of sorted q-grams. | |

An index based on a lazy suffix tree (see Giegerich et al., "Efficient implementation of lazy suffix trees"). | |

Iterator to search for all maximal repeats. | |

Iterator to search for MultiMems. | |

Iterator to search for all maximum unique matches. | |

A variable shape with one optional gap. | |

An index based on an array of sorted q-grams. | |

An adapter for the Pizza & Chili index API. | |

A variable length ungapped shape (also called q-gram or k-mer). | |

Iterator to search for all supermaximal repeats. | |

Iterator to search for all supermaximal repeats (for enh. suffix arrays only). | |

Iterator for suffix trees that can go down and right beginning from the root. | |

Iterator for suffix trees that can go down, right, and up. Supports depth-first search. | |

A fixed length ungapped shape (also called q-gram or k-mer). | |

Abstract iterator for suffix trees. |

Iterators

Adapts iterators to Rooted Iterator. | |

Iterator for AlignCols pseudo container. | |

Adapts position to iterator. | |

A simple iterator. |

Miscellaneous

An Interval Tree Node that stores intervals explicitely in each node. | |

Spec for IntervalTreeNode that stores only the relevant point in each node meaning the endpoint of the interval in the list sorted by endpoints (list2) and only the beginpoint of the interval in the list sorted by beginpoints (list1). | |

Stores the priority data on a heap. |

Modifier

Modifier that adds a character to an alphabet. | |

Mirrors the characters from begin to end. | |

Transforms the characters of the |

Motif Search

Represents the C ("constant") computation scheme for handling "zero" probabilities. | |

Represents the ePatternBranching algorithm of Davila and Rajasekaran. | |

Represents the P computation scheme for handling "zero" probabilities. | |

Represents the Pms1 algorithm developed by Rajasekaran et al. | |

Represents the Pmsp algorithm of Davila et al. | |

Represents the PROJECTION algorithm of Buhler and Tompa. |

Pattern Matching

Provides fast approximate searching of one string in another using Myer's fast bit-parallel algorithm with application of the Ukkonen-trick. |

Pipelining

Casts the input type in a specific output type. | |

Extends the input stream by a second field which enumerates the elements. | |

Outputs tuples of the | |

Outputs tuples of the | |

Applies a specific function to the input stream. | |

Joins two or three input streams. | |

Configuration of Mapper. | |

Configuration of Mapper. | |

Permutes all elements using a custom destination function. | |

Extends the input stream by a second field which names the elements. | |

Configuration of Pool. | |

Configuration of Pool. | |

Stores/Retrieves all elements to/from disk. | |

Outputs m-tuples beginning at a position of difference cover DC. | |

Shifts the input stream by | |

Configuration of Sorter. | |

Configuration of Sorter. | |

Sorts all elements using a custom compare function. | |

Pipelining adaptor for arbitrary containers or iterators. | |

Outputs tuples of the |

Proxies

Proxy that is implemented by an iterator. |

Random

Geometric probability density function with | |

Log-normal probability density function. | |

Mersenne Twister 19937 Random Number Generator | |

Normal probability density function. | |

Functor wrapper for random number generation. | |

Uniform distribution probability density function over a closed interval [min, max]. |

Scoring

Edit distance scoring scheme. | |

A general scoring matrix. | |

Simple scoring scheme that has scores for matches, mismatches, opening gaps and extending gaps. |

Searching

Approximate Backward Nondeterministic Dawg Matching algorithm. Approximate string matching using bit parallelism. | |

Multiple exact string matching using Aho-Corasick. | |

Backward Factor Automaton Matching algorithm. | |

Backward Oracle Matching algorithm. | |

Backward Suffix Trie Matching algorithm. | |

Backward Nondeterministic Dawg Matching algorithm. Exact string matching using bit parallelism. | |

A dynamic programming algorithm for approximate string-matching with a user-definable scoring function. | |

A brute force online searching algorithm for approximate string matching with hamming distance. | |

By using this Specialization the hierarchical verification is enabled. | |

Exact string matching using Horspool's algorithm (1980). | |

Multi-Pattern Backward Factor Automaton Matching. | |

Multi-Pattern Backward Factor Automaton Matching using an oracle automaton. | |

Multiple exact string matching using bit parallelism. The total size of the patterns should fit into a computer word. | |

By using this Specialization the hierarchical verification is disabled. | |

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. | |

Multiple exact string matching using set horspool algorithm. | |

Exact string matching using bit parallelism. The Shift-And algorithm is applicable to search small patterns in texts using a small alphabet. | |

Exact string matching using bit parallelism. The Shift-Or algorithm is applicable to search small patterns in texts using a small alphabet. | |

A brute force online searching algorithm. | |

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 ε. | |

The specialization for the general swift filter that finds epsilon matches between haystack and needle. | |

The specialization for the semi-global swift filter that finds regions of the haystack where a needle matches with an error rate less than ε. | |

Exact string matching with wildcards using bit parallelism. The Shift-And algorithm is applicable to search small patterns in texts using a small alphabet. | |

Online-algorithm for multi-pattern search. |

Seed Handling

Describes a seed with start and end position2 and diagonal upper and lower bounds. Additionaly diagonal segments between start and end position2 are stored. | |

Faster than the pointer version but needs data size of at least size_t. | |

Datasize of at least 4 bytes. Not suitable for many blocks. | |

Data structure which represents a seed of multiple sequences. | |

SeedSet that uses seeds without scores. | |

SeedSet that uses scored Seeds. | |

Describes a seed with start and end position and diagonal upper and lower bounds. |

Segments

An arbitrary segment. | |

First part of a sequence. | |

End part segment of a sequence. |

Sequences

A string set storing the concatenation of all strings within one string. | |

Iterator that sequentially iterates through the elements of a StringSet as if they were directly concatenated, cmp. ConcatDirect. | |

A string set storing references of the strings. | |

Journaled versions of arbitrary underlying string. | |

A string set storing the strings as members. |

Strings

Expandable string that is stored on heap. | |

Fast, static-size string. | |

String optimized for push_back, top, and pop (Stack behaviour). | |

Allows adaption of strings to C-style strings. | |

String that is stored in external memory. | |

Read sequence data from file. | |

String that is stored in external memory. Uses memory mapping. | |

A string that stores as many values in one machine word as possible. | |

String used by the Pizza & Chili indices. |

SeqAn - Sequence Analysis Library - www.seqan.de