vg
tools for working with variation graphs
|
Namespaces | |
vg | |
Functions | |
vector< pair< gcsa::node_type, size_t > > | vg::mem_node_start_positions (const HandleGraph &graph, const vg::MaximalExactMatch &mem) |
get the handles that a mem covers More... | |
bdsg::HashGraph | vg::cluster_subgraph_containing (const HandleGraph &base, const Alignment &aln, const vector< vg::MaximalExactMatch > &cluster, const GSSWAligner *aligner) |
return a containing subgraph connecting the mems More... | |
bdsg::HashGraph | vg::cluster_subgraph_walk (const HandleGraph &base, const Alignment &aln, const vector< vg::MaximalExactMatch > &mems, double expansion) |