kaori::SegmentedMismatches< num_segments_ >::Result Struct Reference

Result of the segmented search. More...

#include <MismatchTrie.hpp>

Public Attributes
BarcodeIndex	index = 0
int	mismatches = 0
std::array< int, num_segments_ >	per_segment

Detailed Description

template<int num_segments_>
struct kaori::SegmentedMismatches< num_segments_ >::Result

Result of the segmented search.

Member Data Documentation

index

template<int num_segments_>

BarcodeIndex kaori::SegmentedMismatches< num_segments_ >::Result::index = 0

Index of the known barcode sequence where the number of mismatches in each segment is less than or equal to max_mismatches and the total number of mismatches across all segments is the lowest among all barcode sequences.

If multiple barcode sequences share the same lowest total, the match is ambiguous and STATUS_AMBIGUOUS is reported. If no barcode sequences satisfy the max_mismatches condition, STATUS_UNMATCHED is reported.

mismatches

template<int num_segments_>

int kaori::SegmentedMismatches< num_segments_ >::Result::mismatches = 0

Total number of mismatches between the barcode sequence from index and the input sequence. This should be ignored if index == STATUS_UNMATCHED, as the search will terminate early without computing the exact number of mismatches if max_mismatches is exceeded.

per_segment

template<int num_segments_>

std::array<int, num_segments_> kaori::SegmentedMismatches< num_segments_ >::Result::per_segment

Number of mismatches in each segment of the sequence. This should be ignored if index == STATUS_UNMATCHED, as the search will terminate early without computing the exact number of mismatches if max_mismatches is exceeded.

---

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

• kaori/MismatchTrie.hpp