Are there any plans to upgrade the backend SBT code to use AllSome or Split sequence bloom trees, as they're faster in both creating and searching the indices?

They've been implemented, but the licenses isn't compatible with the BSD.

• AllSome Sequence Bloom Trees paper - code: https://github.com/medvedevgroup/bloomtree-allsome (GPL-3)
• Split Sequence Bloom Trees paper - code: https://github.com/Kingsford-Group/splitsbt (GPL-3)

I see there's some interest in using Rust for the backend, and this might be a nice excuse to play around in the language. I'm happy to help where I can!