You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Currently comparing a large number of paths in a pangenome graph.
If odgi overlap knows that A overlaps B, will it skip checking if B overlaps A?
I looked at the source code and from what I gather it seems like it will but I could be wrong.
Just looks like a quick optimization that could save a lot of time when comparing large number of paths.
The text was updated successfully, but these errors were encountered:
cgroza
changed the title
Is odgi paths optimized for reciprocal overlaps?
Is odgi overlap optimized for reciprocal overlaps?
May 22, 2023
Hi @cgroza, odgi overlap does not keep this kind of memory, so there is no such optimization. It would be achievable by increasing the memory usage while keeping all already detected pairs in memory.
I see, maybe there could be a memory efficient way to store this in memory (like a pair of integers).
Then, odgi would not output a full matrix, but a sparse one?
This is most useful for comparing large numbers of paths on a pangenome.
I am thinking sets of epigenomic annotations on a pangenome.
Hi,
Currently comparing a large number of paths in a pangenome graph.
If odgi overlap knows that A overlaps B, will it skip checking if B overlaps A?
I looked at the source code and from what I gather it seems like it will but I could be wrong.
Just looks like a quick optimization that could save a lot of time when comparing large number of paths.
The text was updated successfully, but these errors were encountered: