|
vg
tools for working with variation graphs
|
This is the complete list of members for vg::MinimizerMapper, including all inherited members.
| adjust_alignments_for_base_quality | vg::AlignerClient | |
| align_from_chains | vg::MinimizerMapper | |
| align_sequence_between(const pos_t &left_anchor, const pos_t &right_anchor, size_t max_path_length, size_t max_gap_length, const HandleGraph *graph, const GSSWAligner *aligner, Alignment &alignment, const std::string *alignment_name=nullptr, size_t max_dp_cells=std::numeric_limits< size_t >::max(), const std::function< size_t(const Alignment &, const HandleGraph &)> &choose_band_padding=algorithms::pad_band_random_walk()) | vg::MinimizerMapper | protectedstatic |
| align_sequence_between_consistently(const pos_t &left_anchor, const pos_t &right_anchor, size_t max_path_length, size_t max_gap_length, const HandleGraph *graph, const GSSWAligner *aligner, Alignment &alignment, const std::string *alignment_name=nullptr, size_t max_dp_cells=std::numeric_limits< size_t >::max(), const std::function< size_t(const Alignment &, const HandleGraph &)> &choose_band_padding=algorithms::pad_band_random_walk()) | vg::MinimizerMapper | static |
| AlignerClient(double gc_content_estimate=vg::default_gc_content) | vg::AlignerClient | protected |
| annotate_with_minimizer_statistics(Alignment &target, const VectorView< Minimizer > &minimizers, const std::vector< Seed > &seeds, size_t old_seed_count, size_t new_seed_offset, const Funnel &funnel) const | vg::MinimizerMapper | protected |
| attempt_rescue(const Alignment &aligned_read, Alignment &rescued_alignment, const VectorView< Minimizer > &minimizers, bool rescue_forward) | vg::MinimizerMapper | protected |
| chain_info_to_seed(const pos_t &hit, size_t minimizer, const ZipCode &zip) | vg::MinimizerMapper | inlineprotectedstatic |
| chain_score_threshold | vg::MinimizerMapper | |
| choose_band_padding | vg::MinimizerMapper | protected |
| Cluster typedef | vg::MinimizerMapper | protected |
| cluster_coverage_threshold | vg::MinimizerMapper | |
| cluster_score_threshold | vg::MinimizerMapper | |
| clusterer | vg::MinimizerMapper | protected |
| compute_mapq_caps(const Alignment &aln, const VectorView< Minimizer > &minimizers, const SmallBitset &explored) | vg::MinimizerMapper | protected |
| connect_consistently(const std::string &sequence, const pos_t &left_anchor, const pos_t &right_anchor, const WFAExtender &wfa_extender) | vg::MinimizerMapper | protectedstatic |
| default_align_from_chains | vg::MinimizerMapper | static |
| default_chain_score_threshold | vg::MinimizerMapper | static |
| default_cluster_coverage_threshold | vg::MinimizerMapper | static |
| default_cluster_score_threshold | vg::MinimizerMapper | static |
| default_distance_limit | vg::MinimizerMapper | static |
| default_do_dp | vg::MinimizerMapper | static |
| default_exclude_overlapping_min | vg::MinimizerMapper | static |
| default_extension_score_threshold | vg::MinimizerMapper | static |
| default_extension_set_min_score | vg::MinimizerMapper | static |
| default_extension_set_score_threshold | vg::MinimizerMapper | static |
| default_fragment_gap_scale | vg::MinimizerMapper | static |
| default_fragment_max_graph_lookback_bases | vg::MinimizerMapper | static |
| default_fragment_max_graph_lookback_bases_per_base | vg::MinimizerMapper | static |
| default_fragment_max_indel_bases | vg::MinimizerMapper | static |
| default_fragment_max_indel_bases_per_base | vg::MinimizerMapper | static |
| default_fragment_max_min_score | vg::MinimizerMapper | static |
| default_fragment_max_read_lookback_bases | vg::MinimizerMapper | static |
| default_fragment_max_read_lookback_bases_per_base | vg::MinimizerMapper | static |
| default_fragment_min_score | vg::MinimizerMapper | static |
| default_fragment_points_per_possible_match | vg::MinimizerMapper | static |
| default_fragment_score_fraction | vg::MinimizerMapper | static |
| default_fragment_set_score_threshold | vg::MinimizerMapper | static |
| default_gap_scale | vg::MinimizerMapper | static |
| default_gapless_extension_limit | vg::MinimizerMapper | static |
| default_hard_hit_cap | vg::MinimizerMapper | static |
| default_hit_cap | vg::MinimizerMapper | static |
| default_item_bonus | vg::MinimizerMapper | static |
| default_item_scale | vg::MinimizerMapper | static |
| default_mapq_score_scale | vg::MinimizerMapper | static |
| default_mapq_score_window | vg::MinimizerMapper | static |
| default_max_alignments | vg::MinimizerMapper | static |
| default_max_chain_connection | vg::MinimizerMapper | static |
| default_max_chaining_problems | vg::MinimizerMapper | static |
| default_max_chains_per_tree | vg::MinimizerMapper | static |
| default_max_direct_to_chain | vg::MinimizerMapper | static |
| default_max_dozeu_cells | vg::MinimizerMapper | static |
| default_max_dp_cells | vg::MinimizerMapper | static |
| default_max_extension_mismatches | vg::MinimizerMapper | static |
| default_max_extensions | vg::MinimizerMapper | static |
| default_max_fragment_length | vg::MinimizerMapper | static |
| default_max_fragments | vg::MinimizerMapper | static |
| default_max_graph_lookback_bases | vg::MinimizerMapper | static |
| default_max_graph_lookback_bases_per_base | vg::MinimizerMapper | static |
| default_max_indel_bases | vg::MinimizerMapper | static |
| default_max_indel_bases_per_base | vg::MinimizerMapper | static |
| default_max_local_extensions | vg::MinimizerMapper | static |
| default_max_middle_dp_length | vg::MinimizerMapper | static |
| default_max_middle_gap | vg::MinimizerMapper | static |
| default_max_min_chain_score | vg::MinimizerMapper | static |
| default_max_multimaps | vg::MinimizerMapper | static |
| default_max_read_lookback_bases | vg::MinimizerMapper | static |
| default_max_read_lookback_bases_per_base | vg::MinimizerMapper | static |
| default_max_rescue_attempts | vg::MinimizerMapper | static |
| default_max_skipped_bases | vg::MinimizerMapper | static |
| default_max_tail_dp_length | vg::MinimizerMapper | static |
| default_max_tail_gap | vg::MinimizerMapper | static |
| default_max_tail_length | vg::MinimizerMapper | static |
| default_max_to_fragment | vg::MinimizerMapper | static |
| default_max_unique_min | vg::MinimizerMapper | static |
| default_min_chain_score_per_base | vg::MinimizerMapper | static |
| default_min_chaining_problems | vg::MinimizerMapper | static |
| default_min_chains | vg::MinimizerMapper | static |
| default_min_extension_sets | vg::MinimizerMapper | static |
| default_min_extensions | vg::MinimizerMapper | static |
| default_min_to_fragment | vg::MinimizerMapper | static |
| default_min_unique_node_fraction | vg::MinimizerMapper | static |
| default_minimizer_coverage_flank | vg::MinimizerMapper | static |
| default_minimizer_downsampling_max_window_length | vg::MinimizerMapper | static |
| default_minimizer_downsampling_window_count | vg::MinimizerMapper | static |
| default_minimizer_score_fraction | vg::MinimizerMapper | static |
| default_num_bp_per_min | vg::MinimizerMapper | static |
| default_pad_cluster_score_threshold | vg::MinimizerMapper | static |
| default_pad_zipcode_tree_score_threshold | vg::MinimizerMapper | static |
| default_paired_distance_stdevs | vg::MinimizerMapper | static |
| default_paired_rescue_score_limit | vg::MinimizerMapper | static |
| default_points_per_possible_match | vg::MinimizerMapper | static |
| default_rec_penalty_chain | vg::MinimizerMapper | static |
| default_rec_penalty_fragment | vg::MinimizerMapper | static |
| default_rescue_likelihood_limit | vg::MinimizerMapper | static |
| default_rescue_seed_limit | vg::MinimizerMapper | static |
| default_rescue_subgraph_stdevs | vg::MinimizerMapper | static |
| default_set_refpos | vg::MinimizerMapper | static |
| default_show_work | vg::MinimizerMapper | static |
| default_softclip_penalty | vg::MinimizerMapper | static |
| default_sort_by_chain_score | vg::MinimizerMapper | static |
| default_track_correctness | vg::MinimizerMapper | static |
| default_track_position | vg::MinimizerMapper | static |
| default_track_provenance | vg::MinimizerMapper | static |
| default_use_explored_cap | vg::MinimizerMapper | static |
| default_wfa_distance | vg::MinimizerMapper | static |
| default_wfa_distance_per_base | vg::MinimizerMapper | static |
| default_wfa_max_distance | vg::MinimizerMapper | static |
| default_wfa_max_max_mismatches | vg::MinimizerMapper | static |
| default_wfa_max_mismatches | vg::MinimizerMapper | static |
| default_wfa_max_mismatches_per_base | vg::MinimizerMapper | static |
| default_zipcode_tree_coverage_threshold | vg::MinimizerMapper | static |
| default_zipcode_tree_scale | vg::MinimizerMapper | static |
| default_zipcode_tree_score_threshold | vg::MinimizerMapper | static |
| dfs_gbwt(const Position &from, size_t walk_distance, const function< void(const handle_t &)> &enter_handle, const function< void(void)> exit_handle) const | vg::MinimizerMapper | protected |
| dfs_gbwt(handle_t from_handle, size_t from_offset, size_t walk_distance, const function< void(const handle_t &)> &enter_handle, const function< void(void)> exit_handle) const | vg::MinimizerMapper | protected |
| dfs_gbwt(const gbwt::SearchState &start_state, size_t from_offset, size_t walk_distance, const function< void(const handle_t &)> &enter_handle, const function< void(void)> exit_handle) const | vg::MinimizerMapper | protected |
| distance_between(const pos_t &pos1, const pos_t &pos2) | vg::MinimizerMapper | protected |
| distance_between(const Alignment &aln1, const Alignment &aln2) | vg::MinimizerMapper | protected |
| distance_index | vg::MinimizerMapper | protected |
| distance_limit | vg::MinimizerMapper | |
| distance_to_annotation(int64_t distance) const | vg::MinimizerMapper | protected |
| do_alignment_on_chains(Alignment &aln, const std::vector< Seed > &seeds, const VectorView< MinimizerMapper::Minimizer > &minimizers, const vector< algorithms::Anchor > &seed_anchors, const std::vector< std::vector< size_t >> &chains, const std::vector< size_t > &chain_source_tree, const std::vector< double > &multiplicity_by_chain, const std::vector< int > &chain_score_estimates, const std::vector< std::vector< size_t >> &minimizer_kept_chain_count, vector< Alignment > &alignments, vector< double > &multiplicity_by_alignment, vector< size_t > &alignments_to_source, SmallBitset &minimizer_explored, aligner_stats_t &stats, bool &funnel_depleted, LazyRNG &rng, Funnel &funnel) const | vg::MinimizerMapper | protected |
| do_chaining_on_fragments(Alignment &aln, const ZipCodeForest &zip_code_forest, const std::vector< Seed > &seeds, const VectorView< MinimizerMapper::Minimizer > &minimizers, const std::vector< std::vector< size_t >> &fragments, const std::vector< double > &fragment_scores, const std::vector< algorithms::Anchor > &fragment_anchors, const std::vector< size_t > &fragment_source_tree, const std::vector< std::vector< size_t >> &minimizer_kept_fragment_count, const std::vector< double > &multiplicity_by_fragment, std::vector< std::vector< size_t >> &chains, std::vector< size_t > &chain_source_tree, std::vector< int > &chain_score_estimates, std::vector< std::vector< size_t >> &minimizer_kept_chain_count, std::vector< double > &multiplicity_by_chain, vector< double > &multiplicity_by_tree, std::unordered_map< size_t, std::vector< size_t >> &good_fragments_in, LazyRNG &rng, Funnel &funnel) const | vg::MinimizerMapper | protected |
| do_dp | vg::MinimizerMapper | |
| do_fragmenting_on_trees(Alignment &aln, const ZipCodeForest &zip_code_forest, const std::vector< Seed > &seeds, const VectorView< MinimizerMapper::Minimizer > &minimizers, const vector< algorithms::Anchor > &seed_anchors, std::vector< std::vector< size_t >> &fragments, std::vector< double > &fragment_scores, std::vector< algorithms::Anchor > &fragment_anchors, std::vector< size_t > &fragment_source_tree, std::vector< std::vector< size_t >> &minimizer_kept_fragment_count, std::vector< double > &multiplicity_by_fragment, std::vector< Alignment > &alignments, SmallBitset &minimizer_explored, vector< double > &multiplicity_by_alignment, LazyRNG &rng, Funnel &funnel) const | vg::MinimizerMapper | protected |
| dump_chaining_problem(const std::vector< algorithms::Anchor > &anchors, const std::vector< size_t > &cluster_seeds_sorted, const HandleGraph &graph) | vg::MinimizerMapper | protectedstatic |
| dump_debug_chains(const ZipCodeForest &zip_code_forest, const std::vector< Seed > &seeds, const VectorView< Minimizer > &minimizers, const std::vector< std::vector< size_t >> &fragments, const std::unordered_map< size_t, std::vector< size_t >> &good_fragments_in, const std::vector< std::vector< size_t >> &chains, const std::vector< size_t > &chain_source_tree, const PathPositionHandleGraph *path_graph) | vg::MinimizerMapper | protectedstatic |
| dump_debug_clustering(const Cluster &cluster, size_t cluster_number, const VectorView< Minimizer > &minimizers, const std::vector< Seed > &seeds) | vg::MinimizerMapper | protectedstatic |
| dump_debug_dotplot(const std::string &name, const VectorView< Minimizer > &minimizers, const std::vector< Seed > &seeds, const std::vector< std::pair< std::string, std::vector< std::vector< size_t >>>> &seed_sets, const PathPositionHandleGraph *path_graph) | vg::MinimizerMapper | protectedstatic |
| dump_debug_extension_set(const HandleGraph &graph, const Alignment &aln, const vector< GaplessExtension > &extended_seeds) | vg::MinimizerMapper | protectedstatic |
| dump_debug_graph(const HandleGraph &graph) | vg::MinimizerMapper | protectedstatic |
| dump_debug_minimizers(const VectorView< Minimizer > &minimizers, const string &sequence, const vector< size_t > *to_include=nullptr, size_t start_offset=0, size_t length_limit=std::numeric_limits< size_t >::max()) | vg::MinimizerMapper | protectedstatic |
| dump_debug_query(const Alignment &aln) | vg::MinimizerMapper | protectedstatic |
| dump_debug_query(const Alignment &aln1, const Alignment &aln2) | vg::MinimizerMapper | protectedstatic |
| dump_debug_seeds(const VectorView< Minimizer > &minimizers, const std::vector< Seed > &seeds, const std::vector< size_t > &selected_seeds) | vg::MinimizerMapper | protectedstatic |
| dump_debug_sequence(ostream &out, const string &sequence, size_t start_offset=0, size_t length_limit=std::numeric_limits< size_t >::max()) | vg::MinimizerMapper | protectedstatic |
| exclude_overlapping_min | vg::MinimizerMapper | |
| extend_seed_group(const std::vector< size_t > &seed_group, size_t source_num, const VectorView< Minimizer > &minimizers, const std::vector< Seed > &seeds, const string &sequence, size_t max_mismatches, vector< vector< size_t >> *minimizer_kept_count=nullptr, Funnel *funnel=nullptr, std::vector< std::vector< size_t >> *seeds_used=nullptr) const | vg::MinimizerMapper | protected |
| extender | vg::MinimizerMapper | protected |
| extension_score_threshold | vg::MinimizerMapper | |
| extension_set_min_score | vg::MinimizerMapper | |
| extension_set_score_threshold | vg::MinimizerMapper | |
| extension_to_alignment(const GaplessExtension &extension, Alignment &alignment) const | vg::MinimizerMapper | protected |
| faster_cap(const VectorView< Minimizer > &minimizers, vector< size_t > &minimizers_explored, const string &sequence, const string &quality_bytes) | vg::MinimizerMapper | protectedstatic |
| finalize_fragment_length_distr() | vg::MinimizerMapper | inline |
| find_chain_alignment(const Alignment &aln, const VectorView< algorithms::Anchor > &to_chain, const std::vector< size_t > &chain, aligner_stats_t *stats=nullptr) const | vg::MinimizerMapper | protected |
| find_minimizers(const std::string &sequence, Funnel &funnel) const | vg::MinimizerMapper | protected |
| find_optimal_tail_alignments(const Alignment &aln, const vector< GaplessExtension > &extended_seeds, LazyRNG &rng, Alignment &best, Alignment &second_best) const | vg::MinimizerMapper | protected |
| find_seeds(const std::vector< Minimizer > &minimizers_in_read_order, const VectorView< Minimizer > &minimizers, const Alignment &aln, Funnel &funnel) const | vg::MinimizerMapper | protected |
| fix_dozeu_end_deletions(Alignment &rescued_alignment) const | vg::MinimizerMapper | protected |
| fix_dozeu_score(Alignment &rescued_alignment, const HandleGraph &rescue_graph, const std::vector< handle_t > &topological_order) const | vg::MinimizerMapper | protected |
| flag_repetitive_minimizers(std::vector< Minimizer > &minimizers_in_read_order) const | vg::MinimizerMapper | protected |
| for_each_agglomeration_interval(const VectorView< Minimizer > &minimizers, const string &sequence, const string &quality_bytes, const vector< size_t > &minimizer_indices, const function< void(size_t, size_t, size_t, size_t)> &iteratee) | vg::MinimizerMapper | protectedstatic |
| force_fragment_length_distr(double mean, double stdev) | vg::MinimizerMapper | inline |
| fragment_distr_is_finalized() | vg::MinimizerMapper | inline |
| fragment_gap_scale | vg::MinimizerMapper | |
| fragment_length_distr | vg::MinimizerMapper | protected |
| fragment_max_graph_lookback_bases | vg::MinimizerMapper | |
| fragment_max_graph_lookback_bases_per_base | vg::MinimizerMapper | |
| fragment_max_indel_bases | vg::MinimizerMapper | |
| fragment_max_indel_bases_per_base | vg::MinimizerMapper | |
| fragment_max_min_score | vg::MinimizerMapper | |
| fragment_max_read_lookback_bases | vg::MinimizerMapper | |
| fragment_max_read_lookback_bases_per_base | vg::MinimizerMapper | |
| fragment_min_score | vg::MinimizerMapper | |
| fragment_points_per_possible_match | vg::MinimizerMapper | |
| fragment_score_fraction | vg::MinimizerMapper | |
| fragment_set_score_threshold | vg::MinimizerMapper | |
| gap_scale | vg::MinimizerMapper | |
| gapless_extension_limit | vg::MinimizerMapper | |
| gbwt_graph | vg::MinimizerMapper | protected |
| gc_content_estimate | vg::AlignerClient | protected |
| get_aligner(bool have_qualities=true) const | vg::AlignerClient | protected |
| get_best_alignment_against_any_tree(const vector< TreeSubgraph > &trees, const string &sequence, const Position &default_position, bool pin_left, size_t longest_detectable_gap, LazyRNG &rng) const | vg::MinimizerMapper | protected |
| get_best_chain_stats(Alignment &aln, const ZipCodeForest &zip_code_forest, const std::vector< Seed > &seeds, const VectorView< MinimizerMapper::Minimizer > &minimizers, const std::vector< std::vector< size_t >> &fragments, const std::unordered_map< size_t, std::vector< size_t >> &good_fragments_in, const std::vector< std::vector< size_t >> &chains, const std::vector< size_t > &chain_source_tree, const vector< algorithms::Anchor > &seed_anchors, const std::vector< int > &chain_score_estimates, bool &best_chain_correct, double &best_chain_coverage, size_t &best_chain_longest_jump, double &best_chain_average_jump, size_t &best_chain_anchors, size_t &best_chain_anchor_length, Funnel &funnel) const | vg::MinimizerMapper | protected |
| get_distance_limit(size_t read_length) const | vg::MinimizerMapper | inline |
| get_fragment_length_mean() const | vg::MinimizerMapper | inline |
| get_fragment_length_sample_size() const | vg::MinimizerMapper | inline |
| get_fragment_length_stdev() const | vg::MinimizerMapper | inline |
| get_log10_prob_of_disruption_in_interval(const VectorView< Minimizer > &minimizers, const string &sequence, const string &quality_bytes, const vector< size_t >::iterator &disrupt_begin, const vector< size_t >::iterator &disrupt_end, size_t left, size_t right) | vg::MinimizerMapper | protectedstatic |
| get_prob_of_disruption_in_column(const VectorView< Minimizer > &minimizers, const string &sequence, const string &quality_bytes, const vector< size_t >::iterator &disrupt_begin, const vector< size_t >::iterator &disrupt_end, size_t index) | vg::MinimizerMapper | protectedstatic |
| get_qual_adj_aligner() const | vg::AlignerClient | protected |
| get_read_coverage(const Alignment &aln, const VectorView< std::vector< size_t >> &seed_sets, const std::vector< Seed > &seeds, const VectorView< Minimizer > &minimizers) const | vg::MinimizerMapper | protected |
| get_regular_aligner() const | vg::AlignerClient | protected |
| get_tail_forest(const GaplessExtension &extended_seed, size_t read_length, bool left_tails, size_t *longest_detectable_gap=nullptr) const | vg::MinimizerMapper | protected |
| hard_hit_cap | vg::MinimizerMapper | |
| hit_cap | vg::MinimizerMapper | |
| immutable_path_from_length(const ImmutablePath &path) | vg::MinimizerMapper | protectedstatic |
| ImmutablePath typedef | vg::MinimizerMapper | protected |
| item_bonus | vg::MinimizerMapper | |
| item_scale | vg::MinimizerMapper | |
| k | vg::MinimizerMapper | protected |
| log_alignment(const Alignment &aln) | vg::MinimizerMapper | protectedstatic |
| log_alignment(const Path &path, bool force_condensed=false) | vg::MinimizerMapper | protectedstatic |
| log_bits(const std::vector< bool > &bits) | vg::MinimizerMapper | protectedstatic |
| log_name() | vg::MinimizerMapper | protectedstatic |
| LONG_LIMIT | vg::MinimizerMapper | protectedstatic |
| longest_detectable_gap_in_range(const Alignment &aln, const std::string::const_iterator &sequence_begin, const std::string::const_iterator &sequence_end, const GSSWAligner *aligner) | vg::MinimizerMapper | protectedstatic |
| MANY_LIMIT | vg::MinimizerMapper | protectedstatic |
| map(Alignment &aln, AlignmentEmitter &alignment_emitter) | vg::MinimizerMapper | |
| map(Alignment &aln) | vg::MinimizerMapper | |
| map_from_chains(Alignment &aln) | vg::MinimizerMapper | |
| map_from_extensions(Alignment &aln) | vg::MinimizerMapper | |
| map_paired(Alignment &aln1, Alignment &aln2, vector< pair< Alignment, Alignment >> &ambiguous_pair_buffer) | vg::MinimizerMapper | |
| map_paired(Alignment &aln1, Alignment &aln2) | vg::MinimizerMapper | |
| mapq_score_scale | vg::MinimizerMapper | |
| mapq_score_window | vg::MinimizerMapper | |
| max_alignments | vg::MinimizerMapper | |
| max_chain_connection | vg::MinimizerMapper | |
| max_chaining_problems | vg::MinimizerMapper | |
| max_chains_per_tree | vg::MinimizerMapper | |
| max_direct_to_chain | vg::MinimizerMapper | |
| max_dozeu_cells | vg::MinimizerMapper | |
| max_dp_cells | vg::MinimizerMapper | |
| max_extension_mismatches | vg::MinimizerMapper | |
| max_extensions | vg::MinimizerMapper | |
| max_fragment_length | vg::MinimizerMapper | |
| max_fragments | vg::MinimizerMapper | |
| max_graph_lookback_bases | vg::MinimizerMapper | |
| max_graph_lookback_bases_per_base | vg::MinimizerMapper | |
| max_indel_bases | vg::MinimizerMapper | |
| max_indel_bases_per_base | vg::MinimizerMapper | |
| max_local_extensions | vg::MinimizerMapper | |
| max_middle_dp_length | vg::MinimizerMapper | |
| max_middle_gap | vg::MinimizerMapper | |
| max_min_chain_score | vg::MinimizerMapper | |
| max_multimaps | vg::MinimizerMapper | |
| max_read_lookback_bases | vg::MinimizerMapper | |
| max_read_lookback_bases_per_base | vg::MinimizerMapper | |
| max_rescue_attempts | vg::MinimizerMapper | |
| max_skipped_bases | vg::MinimizerMapper | |
| max_tail_dp_length | vg::MinimizerMapper | |
| max_tail_gap | vg::MinimizerMapper | |
| max_tail_length | vg::MinimizerMapper | |
| max_to_fragment | vg::MinimizerMapper | |
| max_unique_min | vg::MinimizerMapper | |
| min_chain_score_per_base | vg::MinimizerMapper | |
| min_chaining_problems | vg::MinimizerMapper | |
| min_chains | vg::MinimizerMapper | |
| min_extension_sets | vg::MinimizerMapper | |
| min_extensions | vg::MinimizerMapper | |
| min_to_fragment | vg::MinimizerMapper | |
| min_unique_node_fraction | vg::MinimizerMapper | |
| minimizer_coverage_flank | vg::MinimizerMapper | |
| minimizer_downsampling_max_window_length | vg::MinimizerMapper | |
| minimizer_downsampling_window_count | vg::MinimizerMapper | |
| minimizer_index | vg::MinimizerMapper | protected |
| minimizer_score_fraction | vg::MinimizerMapper | |
| MinimizerIndex typedef | vg::MinimizerMapper | |
| MinimizerMapper(const gbwtgraph::GBWTGraph &graph, const MinimizerIndex &minimizer_index, SnarlDistanceIndex *distance_index, const ZipCodeCollection *zipcodes, const PathPositionHandleGraph *path_graph=nullptr) | vg::MinimizerMapper | |
| no_chain_info() | vg::MinimizerMapper | inlineprotectedstatic |
| num_bp_per_min | vg::MinimizerMapper | |
| pad_cluster_score_threshold | vg::MinimizerMapper | |
| pad_zipcode_tree_score_threshold | vg::MinimizerMapper | |
| pair_all(std::array< vector< Alignment >, 2 > &mappings) const | vg::MinimizerMapper | protected |
| paired_distance_stdevs | vg::MinimizerMapper | |
| paired_rescue_score_limit | vg::MinimizerMapper | |
| parse_matrix(std::istream &matrix_stream) | vg::AlignerClient | static |
| path_graph | vg::MinimizerMapper | protected |
| payload_type typedef | vg::MinimizerMapper | |
| payload_with_paths | vg::MinimizerMapper | protected |
| pick_mappings_from_alignments(Alignment &aln, const std::vector< Alignment > &alignments, const std::vector< double > &multiplicity_by_alignment, const std::vector< size_t > &alignments_to_source, const std::vector< int > &chain_score_estimates, std::vector< Alignment > &mappings, std::vector< double > &scores, std::vector< double > &multiplicity_by_mapping, bool &funnel_depleted, LazyRNG &rng, Funnel &funnel) const | vg::MinimizerMapper | protected |
| points_per_possible_match | vg::MinimizerMapper | |
| process_until_threshold_a(size_t items, const function< Score(size_t)> &get_score, double threshold, size_t min_count, size_t max_count, LazyRNG &rng, const function< bool(size_t, size_t)> &process_item, const function< void(size_t)> &discard_item_by_count, const function< void(size_t)> &discard_item_by_score) const | vg::MinimizerMapper | protected |
| process_until_threshold_b(const vector< Score > &scores, double threshold, size_t min_count, size_t max_count, LazyRNG &rng, const function< bool(size_t, size_t)> &process_item, const function< void(size_t)> &discard_item_by_count, const function< void(size_t)> &discard_item_by_score) const | vg::MinimizerMapper | protected |
| process_until_threshold_c(size_t items, const function< Score(size_t)> &get_score, const function< bool(size_t, size_t)> &comparator, double threshold, size_t min_count, size_t max_count, LazyRNG &get_seed, const function< bool(size_t, size_t)> &process_item, const function< void(size_t)> &discard_item_by_count, const function< void(size_t)> &discard_item_by_score) const | vg::MinimizerMapper | protected |
| qual_adj_aligner | vg::AlignerClient | private |
| read_group | vg::MinimizerMapper | |
| rec_penalty_chain | vg::MinimizerMapper | |
| rec_penalty_fragment | vg::MinimizerMapper | |
| regular_aligner | vg::AlignerClient | private |
| rescue_algorithm | vg::MinimizerMapper | |
| rescue_dozeu enum value | vg::MinimizerMapper | |
| rescue_gssw enum value | vg::MinimizerMapper | |
| rescue_likelihood_limit | vg::MinimizerMapper | |
| rescue_none enum value | vg::MinimizerMapper | |
| rescue_seed_limit | vg::MinimizerMapper | |
| rescue_subgraph_stdevs | vg::MinimizerMapper | |
| RescueAlgorithm enum name | vg::MinimizerMapper | |
| sample_name | vg::MinimizerMapper | |
| score_alignment_pair(Alignment &aln1, Alignment &aln2, int64_t fragment_distance) | vg::MinimizerMapper | protected |
| score_cluster(Cluster &cluster, size_t i, const VectorView< Minimizer > &minimizers, const std::vector< Seed > &seeds, size_t seq_length, Funnel &funnel) const | vg::MinimizerMapper | protected |
| score_extension_group(const Alignment &aln, const vector< GaplessExtension > &extended_seeds, int gap_open_penalty, int gap_extend_penalty) | vg::MinimizerMapper | protectedstatic |
| score_extensions(const std::vector< std::vector< GaplessExtension >> &extensions, const Alignment &aln, Funnel &funnel) const | vg::MinimizerMapper | protected |
| score_extensions(const std::vector< std::pair< std::vector< GaplessExtension >, size_t >> &extensions, const Alignment &aln, Funnel &funnel) const | vg::MinimizerMapper | protected |
| score_tree(const ZipCodeForest &zip_code_forest, size_t i, const VectorView< Minimizer > &minimizers, const std::vector< Seed > &seeds, size_t seq_length, Funnel &funnel) const | vg::MinimizerMapper | protected |
| Seed typedef | vg::MinimizerMapper | |
| seeds_in_subgraph(const VectorView< Minimizer > &minimizers, const std::unordered_set< nid_t > &subgraph) const | vg::MinimizerMapper | protected |
| set_alignment_scores(const int8_t *score_matrix, int8_t gap_open, int8_t gap_extend, int8_t full_length_bonus) | vg::MinimizerMapper | virtual |
| set_alignment_scores(int8_t match, int8_t mismatch, int8_t gap_open, int8_t gap_extend, int8_t full_length_bonus) | vg::MinimizerMapper | |
| set_alignment_scores(std::istream &matrix_stream, int8_t gap_open, int8_t gap_extend, int8_t full_length_bonus) | vg::MinimizerMapper | |
| set_alignment_scores(const int8_t *score_matrix, int8_t gap_open, int8_t gap_extend, int8_t full_length_bonus) | vg::MinimizerMapper | |
| vg::AlignerClient::set_alignment_scores(int8_t match, int8_t mismatch, int8_t gap_open, int8_t gap_extend, int8_t full_length_bonus) | vg::AlignerClient | virtual |
| vg::AlignerClient::set_alignment_scores(std::istream &matrix_stream, int8_t gap_open, int8_t gap_extend, int8_t full_length_bonus) | vg::AlignerClient | virtual |
| set_refpos | vg::MinimizerMapper | |
| show_work | vg::MinimizerMapper | |
| softclip_penalty | vg::MinimizerMapper | |
| sort_by_chain_score | vg::MinimizerMapper | |
| sort_minimizers_by_score(const std::vector< Minimizer > &minimizers_in_read_order, LazyRNG &rng) const | vg::MinimizerMapper | protected |
| tag_seeds(const Alignment &aln, const std::vector< Seed >::const_iterator &begin, const std::vector< Seed >::const_iterator &end, const VectorView< Minimizer > &minimizers, size_t funnel_offset, Funnel &funnel) const | vg::MinimizerMapper | protected |
| TestMinimizerMapper class | vg::MinimizerMapper | friend |
| to_anchor(const Alignment &aln, const VectorView< Minimizer > &minimizers, std::vector< Seed > &seeds, size_t seed_number, const HandleGraph &graph, const Aligner *aligner) | vg::MinimizerMapper | protectedstatic |
| to_anchor(const Alignment &aln, size_t read_start, size_t read_end, const std::vector< size_t > &sorted_seeds, const std::vector< algorithms::Anchor > &seed_anchors, const std::vector< size_t >::const_iterator &mismatch_begin, const std::vector< size_t >::const_iterator &mismatch_end, const HandleGraph &graph, const Aligner *aligner) | vg::MinimizerMapper | protectedstatic |
| to_anchors(const Alignment &aln, const VectorView< Minimizer > &minimizers, std::vector< Seed > &seeds) const | vg::MinimizerMapper | protected |
| to_path(const ImmutablePath &path) | vg::MinimizerMapper | protectedstatic |
| to_wfa_alignment(const algorithms::Anchor &anchor, const Alignment &aln, const Aligner *aligner) const | vg::MinimizerMapper | protected |
| track_correctness | vg::MinimizerMapper | |
| track_position | vg::MinimizerMapper | |
| track_provenance | vg::MinimizerMapper | |
| unoriented_distance_between(const pos_t &pos1, const pos_t &pos2) const | vg::MinimizerMapper | protected |
| use_explored_cap | vg::MinimizerMapper | |
| uses_syncmers | vg::MinimizerMapper | protected |
| validate_clusters(const std::vector< std::vector< Cluster >> &clusters, const std::vector< std::vector< Seed >> &seeds, size_t read_limit, size_t fragment_limit) const | vg::MinimizerMapper | protected |
| w | vg::MinimizerMapper | protected |
| warned_about_bad_distribution | vg::MinimizerMapper | protected |
| warned_about_rescue_size | vg::MinimizerMapper | |
| warned_about_tail_size | vg::MinimizerMapper | mutable |
| wfa_alignment_to_alignment(const WFAAlignment &wfa_alignment, Alignment &alignment) const | vg::MinimizerMapper | protected |
| wfa_distance | vg::MinimizerMapper | |
| wfa_distance_per_base | vg::MinimizerMapper | |
| wfa_max_distance | vg::MinimizerMapper | |
| wfa_max_max_mismatches | vg::MinimizerMapper | |
| wfa_max_mismatches | vg::MinimizerMapper | |
| wfa_max_mismatches_per_base | vg::MinimizerMapper | |
| window_breaking_quality(const VectorView< Minimizer > &minimizers, vector< size_t > &broken, const string &sequence, const string &quality_bytes) | vg::MinimizerMapper | protectedstatic |
| with_dagified_local_graph(const pos_t &left_anchor, const pos_t &right_anchor, size_t max_path_length, const HandleGraph &graph, const std::function< void(DeletableHandleGraph &, const handle_t &, const handle_t &, const std::function< std::pair< nid_t, bool >(const handle_t &)> &)> &callback) | vg::MinimizerMapper | protectedstatic |
| zip_forest | vg::MinimizerMapper | protected |
| zipcode_tree_coverage_threshold | vg::MinimizerMapper | |
| zipcode_tree_scale | vg::MinimizerMapper | |
| zipcode_tree_score_threshold | vg::MinimizerMapper | |
| zipcodes | vg::MinimizerMapper | protected |
1.8.17