kaori
A C++ library for barcode extraction and matching
|
Handler for paired-end combinatorial barcodes. More...
#include <CombinatorialBarcodesPairedEnd.hpp>
Public Member Functions | |
CombinatorialBarcodesPairedEnd (const char *template_seq1, size_t template_length1, const BarcodePool &barcode_pool1, const char *template_seq2, size_t template_length2, const BarcodePool &barcode_pool2, const Options &options) | |
void | sort () |
const std::vector< std::array< int, 2 > > & | get_combinations () const |
int | get_total () const |
int | get_barcode1_only () const |
int | get_barcode2_only () const |
Handler for paired-end combinatorial barcodes.
In this design, each read contains a barcoding element created from a template with a single variable region. For one read, the barcode is drawn from one pool of options, while the other read contains a barcode from another pool. Combinations are assembled randomly by library construction, where the large number of combinations provide many unique identifiers for cell-tracing applications. This handler will capture the frequencies of each barcode combination.
max_size | Maximum length of the template sequences on both reads. |
|
inline |
[in] | template_seq1 | Pointer to a character array containing the first template sequence. This should contain exactly one variable region. |
template_length1 | Length of the first template. This should be less than or equal to max_size . | |
barcode_pool1 | Pool of known barcode sequences for the variable region in the first template. | |
[in] | template_seq2 | Pointer to a character array containing the second template sequence. This should contain exactly one variable region. |
template_length2 | Length of the second template. This should be less than or equal to max_size . | |
barcode_pool2 | Pool of known barcode sequences for the variable region in the second template. | |
options | Optional parameters. |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
Sort the combinations for easier frequency counting. Combinations are sorted by the first index, and then the second index.