xg-old
xg-old copied to clipboard
vgteam
succinct labeled graphs with collections and paths
I have been using `xg` as a succinct graph data structure since it was a standalone library. When it was merged to `vg`, I had to move on to `libvg`....
As reported in gitter ``` deps/xg/src/xg.cpp: In member function ‘int xg::XG::min_distance_in_paths(int64_t, bool, size_t, int64_t, bool, size_t) const’: deps/xg/src/xg.cpp:2348:22: error: call of overloaded ‘abs(long unsigned int&)’ is ambiguous if (abs(o) <...
When we extract threads we get both orientations. We should be able to use the naming system to track which ones are the "forward" versions and only emit one orientation.
 More than half of this XG index is devoted to vectors of 0s for the 0 threads that start at every side and the 0 usages of every side...
If you build an XG from an existing Graph whose Paths are missing rank information, the Path information gets silently discarded. Or rather, the first traversal is preserved and all...
XG has some code like this in `build()`: ``` // for mapping of ids to ranks using a vector rather than wavelet tree min_id = node_label.begin()->first; max_id = node_label.rbegin()->first; ```...
The documentation for `XG::min_approx_path_distance` indicates that it can be given a list of path names to check for distance, but in fact the vector of names is not used.
I've received these questions. I thought it would be helpful to clarify here. > Say we consider the first 3 nodes of the Figure-5 of vg draft example as a...
As I understand the gPBWT has high memory costs at construction time. In the preprint this is described as something that would be easy to work around. I'm curious how...