{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T14:45:09Z","timestamp":1725806709633},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319119878"},{"type":"electronic","value":"9783319119885"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-319-11988-5_11","type":"book-chapter","created":{"date-parts":[[2014,10,8]],"date-time":"2014-10-08T13:15:40Z","timestamp":1412774140000},"page":"113-126","source":"Crossref","is-referenced-by-count":1,"title":["A Compressed Index for Hamming Distances"],"prefix":"10.1007","author":[{"given":"Francisco","family":"Santoyo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edgar","family":"Ch\u00e1vez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric S.","family":"T\u00e9llez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"Chandrasekhar, V., Sharifi, M., Ross, D.: Survey and evaluation of audio fingerprinting schemes for mobile query-by-example applications. In: Proceedings of ISMIR (2011)"},{"key":"11_CR2","unstructured":"LTD, S.: (2006), http:\/\/www.shazam.com\/"},{"key":"11_CR3","unstructured":"SoundHound (2008), \n                    \n                      http:\/\/www.soundhound.com\/"},{"key":"11_CR4","unstructured":"McFee, B., Lanckriet, G.R.G.: Large-scale music similarity search with spatial trees. In: Klapuri, A., Leider, C. (eds.) ISMIR, pp. 55\u201360. University of Miami (2011)"},{"key":"11_CR5","unstructured":"Bertin-Mahieux, T., Ellis, D.P.W., Whitman, B., Lamere, P.: The million song dataset. In: Klapuri, A., Leider, C. (eds.) ISMIR, University of Miami, pp. 591\u2013596. University of Miami (2011)"},{"key":"11_CR6","unstructured":"Samet, H.: Foundations of Multidimensional and Metric Data Structures, 1st edn. The morgan Kaufman Series in Computer Graphics and Geometic Modeling. Morgan Kaufmann Publishers, University of Maryland at College Park (2006)"},{"issue":"3","key":"11_CR7","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/502807.502808","volume":"33","author":"E. Ch\u00e1vez","year":"2001","unstructured":"Ch\u00e1vez, E., Navarro, G., Baeza-Yates, R., Marroqu\u00edn, J.L.: Searching in metric spaces. ACM Comput. Surv.\u00a033(3), 273\u2013321 (2001)","journal-title":"ACM Comput. Surv."},{"issue":"3","key":"11_CR8","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1023\/A:1012491016871","volume":"15","author":"G. Lu","year":"2001","unstructured":"Lu, G.: Indexing and retrieval of audio: A survey. Multimedia Tools Appl.\u00a015(3), 269\u2013290 (2001)","journal-title":"Multimedia Tools Appl."},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Stober, S., N\u00fcrnberger, A.: Adaptive music retrieval - a state of the art. Multimedia Tools and Applications (2012), \u2019Online First\u2019 article","DOI":"10.1007\/s11042-012-1042-z"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1109\/MMUL.2011.11","volume":"18","author":"R. Yan","year":"2011","unstructured":"Yan, R., Huet, B., Sukthankar, R.: Large-scale multimedia retrieval and mining. IEEE Multimedia\u00a018, 11\u201313 (2011)","journal-title":"IEEE Multimedia"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Camarena-Ibarrola, A., Chavez, E.: A robust entropy-based audio-fingerprint. In: Proceedings of the International Conference on Multimedia and Expo, ICME 2006, pp. 1729\u20131732 (2006)","DOI":"10.1109\/ICME.2006.262884"},{"key":"11_CR12","first-page":"518","volume-title":"Proceedings of the 25th International Conference on Very Large Data Bases, VLDB 1999","author":"A. Gionis","year":"1999","unstructured":"Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: Proceedings of the 25th International Conference on Very Large Data Bases, VLDB 1999, pp. 518\u2013529. Morgan Kaufmann Publishers Inc., San Francisco (1999)"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1145\/1327452.1327494","volume":"51","author":"A. Andoni","year":"2008","unstructured":"Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Communications ACM\u00a051, 117\u2013122 (2008)","journal-title":"Communications ACM"},{"key":"11_CR14","first-page":"27","volume-title":"Poster Proc. Volume of 4th Workshop on Efficient and Experimental Algorithms (WEA)","author":"R. Gonz\u00e1lez","year":"2005","unstructured":"Gonz\u00e1lez, R., Grabowski, S., M\u00e4kinen, V., Navarro, G.: Practical implementation of rank and select queries. In: Poster Proc. Volume of 4th Workshop on Efficient and Experimental Algorithms (WEA), pp. 27\u201338. CTI Press and Ellinika Grammata, Greece (2005)"},{"key":"11_CR15","first-page":"233","volume-title":"Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"R. Raman","year":"2002","unstructured":"Raman, R., Raman, V., Rao, S.S.: 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), pp. 233\u2013242. ACM\/SIAM, San Francisco (2002)"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-540-89097-3_18","volume-title":"String Processing and Information Retrieval","author":"F. Claude","year":"2008","unstructured":"Claude, F., Navarro, G.: Practical rank\/select queries over arbitrary sequences. In: Amir, A., Turpin, A., Moffat, A. (eds.) SPIRE 2008. LNCS, vol.\u00a05280, pp. 176\u2013187. Springer, Heidelberg (2008)"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Okanohara, D., Sadakane, K.: Practical entropy-compressed rank\/select dictionary. In: Proceedings of the Workshop on Algorithm Engineering and Experiments, ALENEX 2007. SIAM, New Orleans (2007)","DOI":"10.1137\/1.9781611972870.6"},{"key":"11_CR18","unstructured":"Tellez, E.S.: Practical Proximity Searching in Large Metric Databases. PhD thesis, Universidad Michoacana, Morelia, Michoac\u00e1n, M\u00e9xico (July 2012)"},{"issue":"7","key":"11_CR19","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1016\/j.is.2012.06.005","volume":"38","author":"E.S. Tellez","year":"2013","unstructured":"Tellez, E.S., Chavez, E., Navarro, G.: Succinct nearest neighbor search. Information Systems\u00a038(7), 1019\u20131030 (2013)","journal-title":"Information Systems"},{"key":"11_CR20","first-page":"841","volume-title":"Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2003","author":"R. Grossi","year":"2003","unstructured":"Grossi, R., Gupta, A., Vitter, J.S.: High-order entropy-compressed text indexes. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2003, pp. 841\u2013850. Society for Industrial and Applied Mathematics, Philadelphia (2003)"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Navarro, G., M\u00e4kinen, V.: Compressed full-text indexes. ACM Computing Surveys 39(1) (2007)","DOI":"10.1145\/1216370.1216372"},{"key":"11_CR22","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1145\/1109557.1109599","volume-title":"Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm, SODA 2006","author":"A. Golynski","year":"2006","unstructured":"Golynski, A., Munro, J.I., Rao, S.S.: Rank\/select operations on large alphabets: a tool for text indexing. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm, SODA 2006, pp. 368\u2013373. ACM, New York (2006)"},{"key":"11_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/3-540-45061-0_29","volume-title":"Automata, Languages and Programming","author":"J.I. Munro","year":"2003","unstructured":"Munro, J.I., Raman, R., Raman, V., Rao, S.S.: Succinct representations of permutations. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 345\u2013356. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11988-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T22:47:25Z","timestamp":1580338045000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11988-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319119878","9783319119885"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11988-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}