[17] Rajeev Raman, Venkatesh Raman, and S. Srinivasa Rao. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’02, pages 233–242, Philadelphia, PA, USA, 2002. Society for Industrial and Applied Mathematics.
Apparently this permits O(log N) querying of Bloom filters. Might have to be adapted for our implementation.
ctb
commented
8 years ago
From Sequence Bloom Trees, http://biorxiv.org/content/early/2015/03/26/017087, ref 17:
[17] Rajeev Raman, Venkatesh Raman, and S. Srinivasa Rao. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’02, pages 233–242, Philadelphia, PA, USA, 2002. Society for Industrial and Applied Mathematics.
Apparently this permits O(log N) querying of Bloom filters. Might have to be adapted for our implementation.