stringology::seed::ApproximateSeedComputation Class Reference

#include <ApproximateSeedComputation.h>

Static Public Member Functions
template<class SymbolType >
static ext::set< ext::pair< string::LinearString< SymbolType >, unsigned > >	compute (const string::LinearString< SymbolType > &pattern, unsigned distance, bool restricted)
template<class SymbolType >
static ext::set< ext::pair< string::LinearString< SymbolType >, unsigned > >	compute (const string::LinearString< SymbolType > &pattern, unsigned distance)

Detailed Description

Class to compute the set of all approximate seeds of a given string with maximum Hamming distance

Source: Veronika Dolanska: Implementace automatovych algoritmu na hledani jader (2020)

Member Function Documentation

compute() [1/2]

template<class SymbolType >

static ext::set< ext::pair< string::LinearString< SymbolType >, unsigned > > stringology::seed::ApproximateSeedComputation::compute ( const string::LinearString< SymbolType > &  pattern, unsigned  distance  )

inlinestatic

Computes all k-approximate seeds of a string, approximation is under Hamming distance Source: Veronika Dolanska: Implementace automatovych algoritmu na hledani jader (2020)

Parameters

pattern	- string for which seeds are computed
distance	- max allowed Hamming distance k

Returns

set of all k-approximate seeds of the input string and their minimal Hamming distance

Here is the call graph for this function:

compute() [2/2]

template<class SymbolType >

static ext::set< ext::pair< string::LinearString< SymbolType >, unsigned > > stringology::seed::ApproximateSeedComputation::compute ( const string::LinearString< SymbolType > &  pattern, unsigned  distance, bool  restricted  )

inlinestatic

Computes all k-approximate seeds of a string, approximation is under Hamming distance Source: Veronika Dolanska: Implementace automatovych algoritmu na hledani jader (2020)

Parameters

pattern	- string for which seeds are computed
distance	- max allowed Hamming distance k
restricted	- whether to compute restricted seeds only

Returns

set of all k-approximate seeds of the input string and their minimal Hamming distance

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/seed/ApproximateSeedComputation.h