vg
tools for working with variation graphs
Namespaces | Functions
chain_items.cpp File Reference
#include "chain_items.hpp"
#include <handlegraph/algorithms/dijkstra.hpp>

Namespaces

 vg
 
 vg::algorithms
 

Functions

ostream & vg::algorithms::operator<< (ostream &out, const Anchor &anchor)
 Explain an Anchor to the given stream. More...
 
ostream & vg::algorithms::operator<< (ostream &out, const TracedScore &value)
 Print operator. More...
 
void vg::algorithms::sort_and_shadow (const std::vector< Anchor > &items, std::vector< size_t > &indexes)
 
void vg::algorithms::sort_and_shadow (std::vector< Anchor > &items)
 
TracedScore vg::algorithms::chain_items_dp (vector< TracedScore > &best_chain_score, const VectorView< Anchor > &to_chain, const SnarlDistanceIndex &distance_index, const HandleGraph &graph, int gap_open, int gap_extension, size_t max_lookback_bases, size_t min_lookback_items, size_t lookback_item_hard_cap, size_t initial_lookback_threshold, double lookback_scale_factor, double min_good_transition_score_per_base, int item_bonus, size_t max_indel_bases)
 
vector< size_t > vg::algorithms::chain_items_traceback (const vector< TracedScore > &best_chain_score, const VectorView< Anchor > &to_chain, const TracedScore &best_past_ending_score_ever)
 
pair< int, vector< size_t > > vg::algorithms::find_best_chain (const VectorView< Anchor > &to_chain, const SnarlDistanceIndex &distance_index, const HandleGraph &graph, int gap_open, int gap_extension, size_t max_lookback_bases, size_t min_lookback_items, size_t lookback_item_hard_cap, size_t initial_lookback_threshold, double lookback_scale_factor, double min_good_transition_score_per_base, int item_bonus, size_t max_indel_bases)
 
int vg::algorithms::score_best_chain (const VectorView< Anchor > &to_chain, const SnarlDistanceIndex &distance_index, const HandleGraph &graph, int gap_open, int gap_extension)
 
size_t vg::algorithms::get_graph_distance (const Anchor &from, const Anchor &to, const SnarlDistanceIndex &distance_index, const HandleGraph &graph)
 Get distance in the graph, or std::numeric_limits<size_t>::max() if unreachable. More...
 
size_t vg::algorithms::get_read_distance (const Anchor &from, const Anchor &to)
 Get distance in the read, or std::numeric_limits<size_t>::max() if unreachable. More...
 

Detailed Description

Non-template function implementations for chaining pieces of a read-to-graph alignment.