{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:03:46Z","timestamp":1725455026742},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642331213"},{"type":"electronic","value":"9783642331220"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33122-0_16","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T06:43:09Z","timestamp":1346136189000},"page":"201-213","source":"Crossref","is-referenced-by-count":6,"title":["Succinct Multibit Tree: Compact Representation of Multibit Trees by Using Succinct Data Structures in Chemical Fingerprint Searches"],"prefix":"10.1007","author":[{"given":"Yasuo","family":"Tabei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-642-13818-8_22","volume-title":"Scientific and Statistical Database Management","author":"Z. Aung","year":"2010","unstructured":"Aung, Z., Ng, S.-K.: An Indexing Scheme for Fast and Accurate Chemical Fingerprint Database Searching. In: Gertz, M., Lud\u00e4scher, B. (eds.) SSDBM 2010. LNCS, vol.\u00a06187, pp. 288\u2013305. Springer, Heidelberg (2010)"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"1866","DOI":"10.1021\/ci900133j","volume":"49","author":"P. Baldi","year":"2009","unstructured":"Baldi, P., Hirschberg, D.: An Intersection Inequality Sharper than the Tanimoto Triangle Inequality for Efficiently Searching Large Databases. Journal of Chemical Information and Modeling\u00a049, 1866\u20131870 (2009)","journal-title":"Journal of Chemical Information and Modeling"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1021\/ci800076s","volume":"48","author":"P. Baldi","year":"2008","unstructured":"Baldi, P., Hirschberg, D., Nasr, R.: Speeding Up Chemical Database Searches Using a Proximity Filter Based on the Logical Exclusive-OR. Journal of Chemical Information and Modeling\u00a048, 1367\u20131378 (2008)","journal-title":"Journal of Chemical Information and Modeling"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Chazelle, B.: A Functional Approach to Data Structures and its Use in Multidimensional Searching. SIAM Journal on Computing\u00a017 (1988)","DOI":"10.1137\/0217026"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1145\/321812.321820","volume":"21","author":"P. Elias","year":"1974","unstructured":"Elias, P.: Efficient Storage and Retrieval by Content and Address of Static Files. Journal of the ACM\u00a021, 246\u2013260 (1974)","journal-title":"Journal of the ACM"},{"key":"16_CR6","unstructured":"Ferragina, P., Manzini, G.: An experimental study of an opportunistic index. In: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 269\u2013278. Society for Industrial and Applied Mathematics (2001)"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Jacobson, G.: Space-efficient Static Trees and Graphs. In: Proceedings of the 30th Annual Symposium of Foundations of Computer Science, pp. 549\u2013554 (1989)","DOI":"10.1109\/SFCS.1989.63533"},{"issue":"2","key":"16_CR8","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1038\/nbt1284","volume":"25","author":"M. Keiser","year":"2007","unstructured":"Keiser, M., Roth, B., Armbruster, B., Ernsberger, P., Irwin, J., Shoichet, B.: Relating protein pharmacology by ligand chemistry. Nature Biotechnology\u00a025(2), 197\u2013206 (2007)","journal-title":"Nature Biotechnology"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Leach, A., Gillet, V.: An introduction to chemoinformatics. Kluwer Academic Publishers, The Netherlands, rev. ed. (2007)","DOI":"10.1007\/978-1-4020-6291-9"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"1358","DOI":"10.1021\/ci100132g","volume":"50","author":"R. Nasr","year":"2010","unstructured":"Nasr, R., Hirschberg, D., Baldi, P.: Hashing Algorithms and Data Structures for Rapid Searches of Fingerprint Vectors. Journal of Chemical Information and Modeling\u00a050, 1358\u20131368 (2010)","journal-title":"Journal of Chemical Information and Modeling"},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1002\/minf.201100089","volume":"30","author":"R. Nasr","year":"2011","unstructured":"Nasr, R., Kristensen, T., Baldi, P.: Tree and hashing data structures to speed up chemical searches: Analysis and experiments. Molecular Informatics\u00a030, 791\u2013800 (2011)","journal-title":"Molecular Informatics"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Navarro, G., Providel, E.: Fast, Small, Simple Rank\/Select on Bitmaps. In: Proc. SEA, pp. 295\u2013306 (2012)","DOI":"10.1007\/978-3-642-30850-5_26"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Okanohara, D., Sadakane, K.: Practical Entropy-Compressed Rank\/Select Dictionary. In: Workshop on Algorithm Engineering & Experiments (2007)","DOI":"10.1137\/1.9781611972870.6"},{"key":"16_CR14","unstructured":"Raman, R., Raman, V., Rao, S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: SODA, pp. 232\u2013242 (2002)"},{"key":"16_CR15","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1021\/ci600358f","volume":"47","author":"S. Swamidass","year":"2007","unstructured":"Swamidass, S., Baldi, P.: Bounds and Algorithms for Exact Searches of Chemical Fingerprints in Linear and Sublinear time. Journal of Chemical Information and Modeling\u00a047, 302\u2013317 (2007)","journal-title":"Journal of Chemical Information and Modeling"},{"key":"16_CR16","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1145\/359168.359175","volume":"22","author":"R.E. Tarjan","year":"1979","unstructured":"Tarjan, R.E., Yao, A.C.: Storing a Sparse Table. Communications of the ACM\u00a022, 606\u2013611 (1979)","journal-title":"Communications of the ACM"},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-642-04241-6_17","volume-title":"Algorithms in Bioinformatics","author":"T.G. Kristensen","year":"2009","unstructured":"Kristensen, T.G., Nielsen, J., Pedersen, C.N.S.: A Tree Based Method for the Rapid Screening of Chemical Fingerprints. In: Salzberg, S.L., Warnow, T. (eds.) WABI 2009. LNCS, vol.\u00a05724, pp. 194\u2013205. Springer, Heidelberg (2009)"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Kristensen, T.G., Nielsen, J., Pedersen, C.N.S.: A tree-based method for the rapid screening of chemical fingerprints. Algorithms for Molecular Biology\u00a05 (2010)","DOI":"10.1186\/1748-7188-5-9"},{"key":"16_CR19","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0166-218X(84)90126-4","volume":"8","author":"G. Turan","year":"1984","unstructured":"Turan, G.: Succinct Representation of Graphs. Discrete Applied Math.\u00a08, 289\u2013294 (1984)","journal-title":"Discrete Applied Math."},{"key":"16_CR20","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1093\/comjnl\/42.3.193","volume":"42","author":"H.E. Williams","year":"1999","unstructured":"Williams, H.E., Zobel, J.: Compressing integers for fast file access. Comput. J.\u00a042, 193\u2013201 (1999)","journal-title":"Comput. J."}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33122-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:55:24Z","timestamp":1558299324000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33122-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642331213","9783642331220"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33122-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}