stringology::indexing::NondeterministicApproximateSuffixAutomatonForHammingDistance Class Reference

#include <NondeterministicApproximateSuffixAutomatonForHammingDistance.h>

Static Public Member Functions
template<class SymbolType >
static automaton::NFA< SymbolType, ext::pair< unsigned int, unsigned int > >	construct (const string::LinearString< SymbolType > &pattern, unsigned int k)

Member Function Documentation

construct()

template<class SymbolType >

automaton::NFA< SymbolType, ext::pair< unsigned int, unsigned int > > stringology::indexing::NondeterministicApproximateSuffixAutomatonForHammingDistance::construct ( const string::LinearString< SymbolType > &  pattern, unsigned int  k  )

static

Construction of nondeterministic k-approximate suffix automaton for given pattern and Hamming distance.

Returns

nondeterministic k-approximate suffix automaton.

Here is the call graph for this function:

Here is the caller graph for this function:

---

The documentation for this class was generated from the following file:

• alib2algo/src/stringology/indexing/NondeterministicApproximateSuffixAutomatonForHammingDistance.h