Class Specialization
IndexWotd
This index represents a lazy suffix tree, meaning that a path from the tree of the index in only computed,
if it is traversed. For details see Giegerich et al., "Efficient implementation of lazy suffix trees".
Include Headers
seqan/index.h
Parameters
The text type. Types: String |
Remarks
Specialization of
Specializations
| The Deferred Frequency Index (see Weese and Schulz, "Efficient string mining under constraints via the deferred frequency index"). |
Metafunctions
| Type of a specific container member (fibre). (Index) | |
| The default alphabet type of a suffix array, i.e. the type to store a position of a string or string set. (Index) | |
| Type of an object that represents a vertex descriptor. |
Functions
| Returns an iterator pointing to the root node of the virtual string tree/trie of an index. The only exception are Postorder iterators, where begin returns an iterator pointing to the leftmost node in the tree/trie. | |
| Resets an object. (Index) | |
| Return the number of sequences in an index' underlying text. (Index) | |
| The end of a container. (Index) | |
| Returns a specific fibre of a container. (Index) | |
| Creates a specific Fibre. (Index) | |
| On-demand creation of a specific Fibre. (Index) | |
| Shortcut for | |
| Returns whether a specific Fibre is present. (Index) | |
| Shortcut for | |
| The number of characters in the underlying text of the index is returned. (Index) | |
| This functions opens an index from disk. (Index) | |
| Initializes a vertex map. | |
| This functions saves an index to disk. (Index) |
Example Programs
See Also
SeqAn - Sequence Analysis Library - www.seqan.de
