|
vg
tools for working with variation graphs
|
Classes | |
| struct | ScoreProperties |
Public Member Functions | |
| WFATree (const gbwtgraph::GBWTGraph &graph, const std::string &sequence, pos_t from, pos_t to, const Aligner &aligner, const WFAExtender::ErrorModel &error_model) | |
| std::uint32_t | size () const |
| uint32_t | parent (std::uint32_t node) const |
| std::int32_t | gap_extend_penalty (std::uint32_t length) const |
| std::int32_t | gap_penalty (std::uint32_t length) const |
| void | extend (std::int32_t score) |
| std::int32_t | next_score (std::int32_t match_score) |
| void | next (std::int32_t score) |
| std::pair< MatchPos, WFAAlignment::Edit > | ins_predecessor (uint32_t node, int32_t score, int32_t diagonal) const |
| std::pair< MatchPos, WFAAlignment::Edit > | del_predecessor (uint32_t node, int32_t score, int32_t diagonal) const |
| std::pair< MatchPos, WFAAlignment::Edit > | match_predecessor (uint32_t node, int32_t score, int32_t diagonal) const |
| void | successor_offset (MatchPos &pos) const |
| void | predecessor_offset (uint32_t &node, uint32_t &offset) const |
| void | trim (const Aligner &aligner) |
Static Public Member Functions | |
| static bool | is_root (std::uint32_t node) |
| static bool | no_pos (pos_t pos) |
Public Attributes | |
| const gbwtgraph::CachedGBWTGraph | graph |
| const std::string & | sequence |
| pos_t | from |
| pos_t | to |
| std::vector< WFANode > | nodes |
| WFAPoint | candidate_point |
| std::uint32_t | candidate_node |
| std::int32_t | mismatch |
| std::int32_t | gap_open |
| std::int32_t | gap_extend |
| std::int32_t | score_bound |
| std::int32_t | max_distance |
| std::int32_t | min_distance |
| std::map< std::int32_t, ScoreProperties > | possible_scores |
Private Member Functions | |
| void | extend_over (std::int32_t score, std::int32_t diagonal, const std::vector< std::uint32_t > &leaves) |
| std::vector< std::uint32_t > | get_leaves () const |
| std::pair< std::int32_t, std::int32_t > | update_diagonal_range (std::pair< std::int32_t, std::int32_t > range, std::int32_t score) const |
| std::pair< int32_t, int32_t > | get_diagonals (int32_t score) |
| void | expand_if_necessary (const MatchPos &pos) |
| MatchPos | find_pos (size_t type, uint32_t node, int32_t score, int32_t diagonal, bool extendable_seq, bool extendable_graph) const |
| bool | at_dead_end (const MatchPos &pos) const |
Static Private Member Functions | |
| static void | adjust_diagonal_range (std::pair< std::int32_t, std::int32_t > &range, std::int32_t diagonal) |
| static std::pair< int32_t, int32_t > | empty_diagonal_range () |
|
inline |
|
inlinestaticprivate |
|
inlineprivate |
|
inline |
|
inlinestaticprivate |
|
inlineprivate |
|
inline |
|
inlineprivate |
|
inlineprivate |
|
inline |
|
inline |
|
inlineprivate |
|
inlineprivate |
|
inline |
|
inlinestatic |
|
inline |
|
inline |
|
inline |
|
inlinestatic |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inlineprivate |
| std::uint32_t vg::WFATree::candidate_node |
| WFAPoint vg::WFATree::candidate_point |
| pos_t vg::WFATree::from |
| std::int32_t vg::WFATree::gap_extend |
| std::int32_t vg::WFATree::gap_open |
| const gbwtgraph::CachedGBWTGraph vg::WFATree::graph |
| std::int32_t vg::WFATree::max_distance |
| std::int32_t vg::WFATree::min_distance |
| std::int32_t vg::WFATree::mismatch |
| std::vector<WFANode> vg::WFATree::nodes |
| std::map<std::int32_t, ScoreProperties> vg::WFATree::possible_scores |
| std::int32_t vg::WFATree::score_bound |
| const std::string& vg::WFATree::sequence |
| pos_t vg::WFATree::to |
1.17.0