Class
String
A sequence container with generic alphabet and many specializations.
String is at the heart of the SeqAn library (SeqAn is for SEQuence ANalaysis after all).
There are various specializations with Alloc String being the default and most widely used one.
Strings can be used to store arbitrary values and can be used for large biologicaly sequences as well as a generic, dynamic array and replace std::vector<> .
![]() | ![]() | ||||||
String | |||||||
![]() | ![]() | ||||||
Concept Definition
Required Functions
Check whether a sequence ends with a given suffix. | |
Check whether a sequence starts with a given prefix. |
Include Headers
seqan/sequence.h
Parameters
The value type, that is the type of the items/characters stored in the string. Metafunctions: Value | |
The specializing type. Metafunctions: Spec |
Implements
Specializations
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. | |
Journaled versions of arbitrary underlying string. | |
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. |
Metafunctions
The default overflow strategy for explicit resize. | |
The default overflow strategy for implicit resize. | |
Infix sequence type. | |
Determines whether a container stores its elements in sequential order. | |
The string type of the finder. | |
Type of an object that represents a position in a container. | |
Prefix sequence type. | |
The default alphabet type of a suffix array, i.e. the type to store a position of a string or string set. | |
The spec of a class. | |
Suffix sequence type. | |
Type of the items in the container or behind an iterator. |
Functions
Concatenate two containers. | |
Appends all sequences stored in files of directory to a StringSet. | |
Assigns one object to another object. | |
Extracts the sequence id up to the first whitespace of a sequence file fragment. | |
Extracts the quality values of a sequence file fragment. | |
Extracts the quality value id of a sequence file fragment. | |
Extracts the sequence part of a sequence file fragment. | |
Extracts the sequence id of a sequence file fragment. | |
Assigns value to item. (ContainerConcept) | |
The last item in container. (ContainerConcept) | |
Convert BamAlignmentRecord to an Align object. | |
The begin of a container. | |
Begin position of object in host. | |
Builds an Alignment Graph from a set of input alignments. | |
Calculates the covariance for the number of word occurrences for two words in a sequence of length n, given a background model. | |
Calculate word overlaps: epsilon(word1,word2)= 1 where word2[j]=word1[j+p] for all j=1...(k-p) | |
Calculate word periodicity (indicator for overlaps) | |
Calculates the probability of a sequence given a Bernoulli model (String of background frequencies) | |
Calculates the variance for the number of word occurrences of a word in a sequence of length n given a background model. | |
Test whether an automaton can parse a string completely. | |
The maximal length. | |
Resets an object. | |
Returns all leaves underneath a given vertex. | |
Complement a sequence or a StringSet in-place. | |
Counts kmers in a sequence. Optionally, a background model is returned. | |
Creates the LF table | |
Creates a factor oracle. | |
Creates a factor oracle for the reversed string. | |
Creates the prefix sum table | |
This functions creates the dictionary. | |
Computes the wavelet tree structure of a text. | |
This functions creates the dictionary structure. | |
Creates a trie of all suffixes of a text. | |
Creates a trie. | |
Creates a trie for all reversed keywords. | |
Determines the consensus pattern of a given profile. | |
Test a container for being empty. | |
The end of a container. | |
End position of object in host. | |
Erases a part of a container | |
Deletes the last item of a container and reduces its size by 1. The container must have a size greater than or equal to 1. | |
Extends a seed. | |
Find all intervals that contain the query point or overlap with the query interval. | |
Find all intervals that contain the query point, exclude intervals that touch the query, i.e. where the query point equals the start or end point. | |
Search for repeats in a text. | |
The first item in container. (ContainerConcept) | |
Computes a pairwise distance matrix from an alignment graph. | |
A value that identifies the underlying sequence. | |
Gets the successor for a given vertex and an edge label. For an automaton a single character is required whereas for a word graph getSuccessor takes a string. | |
Access to the value. (ContainerConcept) | |
Computes the best global pairwise alignment score. | |
Iterates down one edge or a path in a tree. | |
Computes the heaviest increasing subsequence. | |
Creates infix object. | |
Creates infix object. | |
Integrates an alignment into another by copying the gaps. | |
Iterator to item at given position. | |
The number of items/characters. | |
Computes the longest common subsequence. | |
Computes the longest increasing subsequence. | |
Assigns value to item. (ContainerConcept) | |
Computes a guide tree from a distance matrix. | |
Parses a string one character at a time and moves accordingly in the automaton. | |
Position of an iterator. (ContainerConcept) | |
Creates prefix object. | |
Read first sequence from a FASTA file. | |
Read the next sequence record from SequenceStream. | |
Load the infix of a sequence from a FaiIndex. | |
Load a whole sequence from an FaiIndex. | |
Replaces a part of a container with another container. | |
Increases the capacity. | |
Resizes a container. If the new length exceeds the old length the new elements are filled with copies of | |
Makes free space in container | |
Reverse and complement a sequence or a StringSet in-place. | |
Sets the haystack of a Finder object. | |
Sets the host of an object. | |
Sets the needle of a Pattern object and optionally induces preprocessing. | |
Converts a given shape into a sequence of '1' (relevant position) and '0' (irrelevant position). | |
Determines whether two sequences share the same resource. | |
Retrieves a string of delimiter positions of a StringSet which is needed for local<->global position conversions. | |
Takes a shape given as a string of '1' (relevant position) and '0' (irrelevant position) and converts it into a Shape object. | |
Transform a String into a StringSet containing this String. | |
Creates suffix object. | |
Swaps the contents of two values. | |
Access sequence as c-style string. | |
Convert characters in sequence or StringSet to lower case in-place. | |
Performs a topological sort on a directed acyclic graph (DAG). | |
Convert characters in sequence or StringSet to lower case in-place. | |
Inverse of the hash function; for ungapped shapes. | |
Computes a guide tree from a distance matrix. | |
Reference to the value. | |
Write one sequence record from to a SequenceStream object. |
Example Programs
See Also
SeqAn - Sequence Analysis Library - www.seqan.de