-
Notifications
You must be signed in to change notification settings - Fork 10
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
Additional functionality #28
base: master
Are you sure you want to change the base?
Conversation
…ency across large queries
Codecov Report
@@ Coverage Diff @@
## master #28 +/- ##
==========================================
- Coverage 74.71% 66.79% -7.92%
==========================================
Files 1 1
Lines 1574 1801 +227
==========================================
+ Hits 1176 1203 +27
- Misses 398 598 +200
Continue to review full report at Codecov.
|
update to gr.findoverlaps(by = ...). Much more efficient for big queries to be matched per levels specified in "by" metadata field. Previously, by queries first search for all possible overlaps and then filters on matching by queries. The newer implementation uses constructor function gr_construct_by which enables findOverlaps to search for overlaps only within factor levels rather than post-filtering.
Also added gaps functionality for GRangesLists. gr.setdiff2(by = ...) makes use of both gaps with grangeslists and also the new by implementation. New method gr.spreduce reduces by levels of a metadata field.
Also gr.start, gr.end, gr.flipstrand, are all now modified to work with grangeslists