-
Notifications
You must be signed in to change notification settings - Fork 195
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
[wip] Clean up vg augment #2474
Conversation
@ekg I just tried this branch successfully on one of your test files as follows
As discussed, there are probably too many read errors in the augmented graph. I'll be looking at ways to get around this via either |
Awesome! Now I just have get call to work on cyclic graphs.
Can we go right from GFA to pg format?
…On Fri, Sep 20, 2019, 16:42 Glenn Hickey ***@***.***> wrote:
@ekg <https://github.com/ekg> I just tried this branch successfully on
one of your test files as follows
export graph=MHC_37
# quality filter
vg filter $graph.300x.gam -q 15 -t 32 -v > $graph.300x.q15.gam
#Total Filtered: 132353 / 9719544
# covert to packed graph (takes 2 seconds)
vg convert $graph.X32.vg -p > $graph.X32.pg
# augment the packed graph (takes 37 minutes, 2.6G RAM)
vg augment $graph.X32.pg $graph.300x.q15.gam -A $graph.300x.q15.aug.gam -C > $graph.X32.aug.pg
# compare the two graphs
vg stats -NEl $graph.X32.vg
155330
155329
length 4970557
vg convert $graph.X32.aug.pg -v | vg stats - -NEl
5758895
8389027
length 7724570
As discussed, there are probably too many read errors in the augmented
graph. I'll be looking at ways to get around this via either vg filter or vg
augment options soon.
—
You are receiving this because you were mentioned.
Reply to this email directly, view it on GitHub
<#2474?email_source=notifications&email_token=AABDQEL3UKY4SW5JRFRYJHDQKTOO5A5CNFSM4IYRZIHKYY3PNVWWK3TUL52HS4DFVREXG43VMVBW63LNMVXHJKTDN5WW2ZLOORPWSZGOD7G5B6Q#issuecomment-533582074>,
or mute the thread
<https://github.com/notifications/unsubscribe-auth/AABDQEN3JC6TFN5J2GSW2KTQKTOO5ANCNFSM4IYRZIHA>
.
|
Continuing the above example:
The crash doesn't seem obviously related to a cycle in the reference path (though I wouldn't rule it out). The stack doesn't contain anything useful. I'll try the debugger. But when augmentation increases the node count by 40X (and average node length down to 1.3bp), I think you gotta expect trouble (good stress test though)
|
@ekg Trying a coverage we're more used to:
Seems to have worked
|
I guess that via downsampling we get the same kind of filtering effect with augment. It'd just be nicer if we could make that happen directly in augment. |
Switch everything to handle graph code.
Will clean out all support for the old pileup logic in this pr (