On Feb 18, 2:25 pm, James Taylor <[email protected]> wrote:
> As requested, I've put together an example of using the different
> intersection algorithms in bx, with some rough timings.
Nice. I'll see how it compares to other approaches. Also maybe you've
just created the quintessetial dataset and timing that will be used to
compare all interval querying from now on....
On a related note I've read an interesting blog post today on using
python for interval query.
http://www.logarithmic.net/pfh/blog/01234937824
It looks like a variant of binning, but one that combines the bin
number with the size of the interval. The author calls this range
codes. Has anyone seen this type of approach before?
cheers,
Istvan
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"pygr-dev" group.
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to
[email protected]
For more options, visit this group at
http://groups.google.com/group/pygr-dev?hl=en
-~----------~----~----~----~------~----~------~--~---
