a spin-off search path through the trie, which can deal with ambiguous AAs and mismatches
More...
#include <OpenMS/ANALYSIS/ID/AhoCorasickAmbiguous.h>
|
| const char * | it_query = 0 |
| | position in query
|
| |
| Index | tree_pos |
| | position in trie
|
| |
| 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
|
| |
a spin-off search path through the trie, which can deal with ambiguous AAs and mismatches
◆ ACScout() [1/2]
◆ ACScout() [2/2]
| ACScout |
( |
const char * |
query_pos, |
|
|
Index |
tree_pos, |
|
|
uint8_t |
max_aa, |
|
|
uint8_t |
max_mm, |
|
|
uint8_t |
max_prefix_loss |
|
) |
| |
◆ nextValidAA()
Return the next valid AA in the query. If the query was fully traversed, an invalid AA is returned. This moves the internal iterator for the query forwards.
◆ textPos()
Where in the text are we currently?
◆ it_query
◆ max_aaa_leftover
| uint8_t max_aaa_leftover {0} |
number of ambiguous AAs the scout can yet tolerate before exceeding the limit
◆ max_mm_leftover
| uint8_t max_mm_leftover {0} |
number of mismatches the scout can yet tolerate before exceeding the limit
◆ max_prefix_loss_leftover
| 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
◆ tree_pos