![]() |
OpenMS
|
a spin-off search path through the trie, which can deal with ambiguous AAs and mismatches More...
#include <OpenMS/ANALYSIS/ID/AhoCorasickAmbiguous.h>
Public Member Functions | |
| ACScout ()=delete | |
| No default C'tor. More... | |
| ACScout (const char *query_pos, Index tree_pos, uint8_t max_aa, uint8_t max_mm, uint8_t max_prefix_loss) | |
| C'tor with arguments. More... | |
| size_t | textPos (const ACTrieState &state) const |
| Where in the text are we currently? More... | |
| AA | nextValidAA () |
Public Attributes | |
| const char * | it_query = 0 |
| position in query More... | |
| Index | tree_pos |
| position in trie More... | |
| uint8_t | max_aaa_leftover {0} |
| number of ambiguous AAs the scout can yet tolerate before exceeding the limit More... | |
| uint8_t | max_mm_leftover {0} |
| number of mismatches the scout can yet tolerate before exceeding the limit More... | |
| uint8_t | max_prefix_loss_leftover {0} |
| number of AA's which can get lost by following suffix links, before the scout must retire; reaching 0 means retire More... | |
a spin-off search path through the trie, which can deal with ambiguous AAs and mismatches
|
delete |
No default C'tor.
| ACScout | ( | const char * | query_pos, |
| Index | tree_pos, | ||
| uint8_t | max_aa, | ||
| uint8_t | max_mm, | ||
| uint8_t | max_prefix_loss | ||
| ) |
C'tor with arguments.
| AA nextValidAA | ( | ) |
| size_t textPos | ( | const ACTrieState & | state | ) | const |
Where in the text are we currently?
| const char* it_query = 0 |
position in query
| uint8_t max_aaa_leftover {0} |
number of ambiguous AAs the scout can yet tolerate before exceeding the limit
| uint8_t max_mm_leftover {0} |
number of mismatches the scout can yet tolerate before exceeding the limit
| uint8_t max_prefix_loss_leftover {0} |
number of AA's which can get lost by following suffix links, before the scout must retire; reaching 0 means retire
| Index tree_pos |
position in trie