stringology::cover::ApproximateCoversComputation Class Reference

#include <ApproximateCoversComputation.h>

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

Member Function Documentation

compute() [1/2]

template<class SymbolType >

ext::set< ext::pair< string::LinearString< SymbolType >, unsigned > > stringology::cover::ApproximateCoversComputation::compute ( const string::LinearString< SymbolType > &  pattern, unsigned  k  )

static

@override

Here is the call graph for this function:

compute() [2/2]

template<class SymbolType >

ext::set< ext::pair< string::LinearString< SymbolType >, unsigned > > stringology::cover::ApproximateCoversComputation::compute ( const string::LinearString< SymbolType > &  pattern, unsigned  k, bool  restricted = false  )

static

Computes all k-approximate covers of a string Source: Shushkova Irina: Implementace automatových algoritmů na hledání pravidelností (2019), Chapter 2.2

Parameters

pattern	string for which the covers are computed
k	allowed error
restricted	whether to compute the restricted variant

Returns

set of all smallest distance k-approximate covers of the input string with the smallest distances with maximum Hamming distance k.

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/cover/ApproximateCoversComputation.h