News for hackers. Stuff that matters.
Re:Static search trees: 40x faster than binary search by curiouscoding on Wednesday January 01, 2025 @05:03PM (#42569692)
I've added a little motivation section on this :)

The final goal is to index DNA, say a human genome, or a bunch of them, and this is static data.

Then as new DNA comes in (eg is read by a DNA sequencer) we can efficiently query against the index built on the reference genome, and this reference is often fixed.

There are no comments on this comment yet.