{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T01:09:33Z","timestamp":1768266573712,"version":"3.49.0"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,8,2]],"date-time":"2017-08-02T00:00:00Z","timestamp":1501632000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,8,2]],"date-time":"2017-08-02T00:00:00Z","timestamp":1501632000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-0905220"],"award-info":[{"award-number":["IIS-0905220"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["OCI-1048018"],"award-info":[{"award-number":["OCI-1048018"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1162405"],"award-info":[{"award-number":["CNS-1162405"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1247632"],"award-info":[{"award-number":["IIS-1247632"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIP-1414153"],"award-info":[{"award-number":["IIP-1414153"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1447788"],"award-info":[{"award-number":["IIS-1447788"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006754","name":"Army Research Laboratory","doi-asserted-by":"publisher","award":["W911NF-14-1-0316"],"award-info":[{"award-number":["W911NF-14-1-0316"]}],"id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Digital Technology Center at the University of Minnesota"},{"name":"Minnesota Supercomputing Institute"},{"name":"Intel Software and Services Group"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Data Sci Anal"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s41060-017-0064-z","type":"journal-article","created":{"date-parts":[[2017,8,2]],"date-time":"2017-08-02T10:49:50Z","timestamp":1501670990000},"page":"153-172","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["Efficient identification of Tanimoto nearest neighbors"],"prefix":"10.1007","volume":"4","author":[{"given":"David C.","family":"Anastasiu","sequence":"first","affiliation":[]},{"given":"George","family":"Karypis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,2]]},"reference":[{"key":"64_CR1","doi-asserted-by":"crossref","unstructured":"Anastasiu, D.C., Karypis, G.: Efficient identification of tanimoto nearest neighbors. In: Proceedings of the 3rd IEEE International Conference on Data Science and Advanced Analytics, ser. DSAA \u201916 (2016)","DOI":"10.1109\/DSAA.2016.23"},{"issue":"2","key":"64_CR2","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1287\/ijoc.15.2.208.14448","volume":"15","author":"A Strehl","year":"2003","unstructured":"Strehl, A., Ghosh, J.: Relationship-based clustering and visualization for high-dimensional data mining. INFORMS J. Comput. 15(2), 208\u2013230 (2003)","journal-title":"INFORMS J. Comput."},{"key":"64_CR3","unstructured":"Joydeep, A.S., Strehl, E., Ghosh, J., Mooney, R.: Impact of similarity measures on web-page clustering. In: Workshop on Artificial Intelligence for Web Search (AAAI 2000). Citeseer (2000)"},{"issue":"3","key":"64_CR4","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10618-006-0040-z","volume":"13","author":"A Banerjee","year":"2006","unstructured":"Banerjee, A., Ghosh, J.: Scalable clustering algorithms with balancing constraints. Data Min. Knowl. Discov. 13(3), 365\u2013395 (2006)","journal-title":"Data Min. Knowl. Discov."},{"key":"64_CR5","unstructured":"Huang, A.: Similarity measures for text document clustering. In: Proceedings of the Sixth New Zealand Computer Science Research Student Conference, ser. NZCSRSC2008, Christchurch, New Zealand, pp. 49\u201356 (2008)"},{"key":"64_CR6","unstructured":"Lyon, C., Malcolm, J., Dickerson, B.: Detecting short passages of similar text in large document collections. In: Proceedings of the 2001 Conference on Empirical Methods in Natural Language Processing, pp. 118\u2013125 (2001)"},{"key":"64_CR7","unstructured":"Bao, J.-P., Malcolm, J.: Text similarity in academic conference papers. In: Proceedings of 2nd International Plagiarism Conference (2006)"},{"issue":"2","key":"64_CR8","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1109\/TSMCC.2011.2134847","volume":"42","author":"SM Alzahrani","year":"2012","unstructured":"Alzahrani, S.M., Salim, N., Abraham, A.: Understanding plagiarism linguistic patterns, textual features, and detection methods. Trans. Syst. Man Cybern. Part C 42(2), 133\u2013149 (2012)","journal-title":"Trans. Syst. Man Cybern. Part C"},{"key":"64_CR9","doi-asserted-by":"crossref","unstructured":"Curran, J.R., Moens, M.: Improvements in automatic thesaurus extraction. In: Proceedings of the ACL-02 Workshop on Unsupervised Lexical Acquisition-vol. 9. Association for Computational Linguistics, pp. 59\u201366 (2002)","DOI":"10.3115\/1118627.1118635"},{"key":"64_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44467-X_48","volume-title":"A Scalable Approach to Balanced, High-Dimensional Clustering of Market-Baskets","author":"A Strehl","year":"2000","unstructured":"Strehl, A., Ghosh, J.: A Scalable Approach to Balanced, High-Dimensional Clustering of Market-Baskets. Springer, Berlin (2000)"},{"key":"64_CR11","doi-asserted-by":"crossref","unstructured":"Karypis, G.: Evaluation of item-based top-n recommendation algorithms. In: Proceedings of the Tenth International Conference on Information and Knowledge Management, ser. CIKM \u201901. New York: ACM, pp. 247\u2013254 (2001)","DOI":"10.1145\/502585.502627"},{"key":"64_CR12","doi-asserted-by":"crossref","unstructured":"Adam, N.R., Janeja, V.P., Atluri, V.: Neighborhood based detection of anomalies in high dimensional spatio-temporal sensor datasets. In: Proceedings of the 2004 ACM Symposium on Applied Computing, ser. SAC \u201904. New York, NY, USA: ACM, pp. 576\u2013583 (2004)","DOI":"10.1145\/967900.968020"},{"issue":"2","key":"64_CR13","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1021\/ci900419k","volume":"50","author":"H Geppert","year":"2010","unstructured":"Geppert, H., Vogt, M., Bajorath, J.: Current trends in ligand-based virtual screening: molecular representations, data mining methods, new application areas, and performance evaluation. J. Chem. Inf. Model. 50(2), 205\u2013216 (2010)","journal-title":"J. Chem. Inf. Model."},{"issue":"2","key":"64_CR14","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1038\/nbt1284","volume":"25","author":"MJ Keiser","year":"2007","unstructured":"Keiser, M.J., Roth, B.L., Armbruster, B.N., Ernsberger, P., Irwin, B.K., Shoichet, John J.: Relating protein pharmacology by ligand chemistry. Nat. Biotechnol. 25(2), 197\u2013206 (2007)","journal-title":"Nat. Biotechnol."},{"issue":"4","key":"64_CR15","doi-asserted-by":"publisher","first-page":"259","DOI":"10.2174\/1386207043328706","volume":"7","author":"FL Stahura","year":"2004","unstructured":"Stahura, F.L., Bajorath, J.: Virtual screening methods that complement HTS. Comb. Chem. High Throughput Screen 7(4), 259\u2013269 (2004)","journal-title":"Comb. Chem. High Throughput Screen"},{"issue":"2","key":"64_CR16","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s10910-010-9668-4","volume":"48","author":"TG Kristensen","year":"2010","unstructured":"Kristensen, T.G.: Transforming tanimoto queries on real valued vectors to range queries in euclidian space. J. Math. Chem. 48(2), 287\u2013289 (2010)","journal-title":"J. Math. Chem."},{"issue":"8","key":"64_CR17","doi-asserted-by":"publisher","first-page":"1340","DOI":"10.1021\/ci1001235","volume":"50","author":"SM Arif","year":"2010","unstructured":"Arif, S.M., Holliday, J.D., Willett, P.: Inverse frequency weighting of fragments for similarity-based virtual screening. J. Chem. Inf. Model. 50(8), 1340\u20131349 (2010)","journal-title":"J. Chem. Inf. Model."},{"key":"64_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809071","volume-title":"Introduction to Information Retrieval","author":"CD Manning","year":"2008","unstructured":"Manning, C.D., Raghavan, P., Sch\u00fctze, H.: Introduction to Information Retrieval. Cambridge University Press, New York (2008)"},{"issue":"2","key":"64_CR19","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1021\/ci600358f","volume":"47","author":"SJ Swamidass","year":"2007","unstructured":"Swamidass, S.J., Baldi, P.: Bounds and algorithms for fast exact searches of chemical fingerprints in linear and sublinear time. J. Chem. Inf. Model. 47(2), 302\u2013317 (2007)","journal-title":"J. Chem. Inf. Model."},{"issue":"8","key":"64_CR20","doi-asserted-by":"publisher","first-page":"1358","DOI":"10.1021\/ci100132g","volume":"50","author":"R Nasr","year":"2010","unstructured":"Nasr, R., Hirschberg, D.S., Baldi, P.: Hashing algorithms and data structures for rapid searches of fingerprint vectors. J. Chem. Inf. Model. 50(8), 1358\u20131368 (2010)","journal-title":"J. Chem. Inf. Model."},{"issue":"9","key":"64_CR21","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1002\/minf.201100050","volume":"30","author":"Y Tabei","year":"2011","unstructured":"Tabei, Y., Tsuda, K.: Sketchsort: fast all pairs similarity search for large databases of molecular fingerprints. Mol. Inform. 30(9), 801\u2013807 (2011). doi: 10.1002\/minf.201100050","journal-title":"Mol. Inform."},{"key":"64_CR22","doi-asserted-by":"crossref","unstructured":"Kristensen, T.G., Nielsen, J., Pedersen, C.N.S.: Algorithms in Bioinformatics: 9th International Workshop, WABI 2009, Philadelphia, PA, USA, Sept 12\u201313, 2009. Proceedings. Berlin: Springer, 2009, ch. A Tree Based Method for the Rapid Screening of Chemical Fingerprints, pp. 194\u2013205","DOI":"10.1007\/978-3-642-04241-6_17"},{"issue":"2","key":"64_CR23","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1021\/ci800325v","volume":"49","author":"A Smellie","year":"2009","unstructured":"Smellie, A.: Compressed binary bit trees: a new data structure for accelerating database searching. J. Chem. Inf. Model. 49(2), 257\u2013262 (2009)","journal-title":"J. Chem. Inf. Model."},{"issue":"3","key":"64_CR24","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1021\/ci100437e","volume":"51","author":"TG Kristensen","year":"2011","unstructured":"Kristensen, T.G., Nielsen, J., Pedersen, C.N.S.: Using inverted indices for accelerating lingo calculations. J. Chem. Inf. Model. 51(3), 597\u2013600 (2011)","journal-title":"J. Chem. Inf. Model."},{"issue":"9","key":"64_CR25","doi-asserted-by":"publisher","first-page":"2395","DOI":"10.1021\/ci500150t","volume":"54","author":"P Thiel","year":"2014","unstructured":"Thiel, P., Sach-Peltason, L., Ottmann, C., Kohlbacher, O.: Blocked inverted indices for exact clustering of large chemical spaces. J. Chem. Inf. Model. 54(9), 2395\u20132401 (2014)","journal-title":"J. Chem. Inf. Model."},{"key":"64_CR26","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Ganti, V., Kaushik, R.: A primitive operator for similarity joins in data cleaning. In: Proceedings of the 22nd International Conference on Data Engineering, ser. ICDE \u201906. Washington, DC, USA: IEEE Computer Society, p. 5 (2006)","DOI":"10.1109\/ICDE.2006.9"},{"key":"64_CR27","doi-asserted-by":"crossref","unstructured":"Moffat, A., Sacks-davis, R., Wilkinson, R., Zobel, J.: Retrieval of partial documents. In: Information Processing and Management, pp. 181\u2013190 (1994)","DOI":"10.6028\/NIST.SP.500-215.citri"},{"key":"64_CR28","doi-asserted-by":"crossref","unstructured":"Bayardo, R.J., Ma, Y., Srikant, R.: Scaling up all pairs similarity search. In: Proceedings of the 16th International Conference on World Wide Web, ser. WWW \u201907. New York: ACM, pp. 131\u2013140 (2007)","DOI":"10.1145\/1242572.1242591"},{"key":"64_CR29","doi-asserted-by":"crossref","unstructured":"Xiao, C., Wang, W., Lin, X., Yu, J.X.: Efficient similarity joins for near duplicate detection. In: Proceedings of the 17th International Conference on World Wide Web, ser. WWW \u201908. New York: ACM, pp. 131\u2013140 (2008)","DOI":"10.1145\/1367497.1367516"},{"key":"64_CR30","doi-asserted-by":"crossref","unstructured":"Xiao, C., Wang, W., Lin, X., Shang, H.: Top-k set similarity joins. In: Proceedings of the 2009 IEEE International Conference on Data Engineering, ser. ICDE \u201909. Washington, DC: IEEE Computer Society, pp. 916\u2013927 (2009)","DOI":"10.1109\/ICDE.2009.111"},{"issue":"1","key":"64_CR31","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.is.2010.07.003","volume":"36","author":"LA Ribeiro","year":"2011","unstructured":"Ribeiro, L.A., H\u00e4rder, T.: Generalizing prefix filtering to improve set similarity joins. Inf. Syst. 36(1), 62\u201378 (2011)","journal-title":"Inf. Syst."},{"key":"64_CR32","doi-asserted-by":"crossref","unstructured":"Awekar, A., Samatova, N.F.: Fast matching for all pairs similarity search. In: Proceedings of the 2009 IEEE\/WIC\/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology\u2014Vol. 01, ser. WI-IAT \u201909. Washington, DC: IEEE Computer Society, pp. 295\u2013300 (2009)","DOI":"10.1109\/WI-IAT.2009.52"},{"key":"64_CR33","doi-asserted-by":"crossref","unstructured":"Anastasiu, D.C., Karypis, G.: L2ap: fast cosine similarity search with prefix l-2 norm bounds. In: 30th IEEE International Conference on Data Engineering, ser. ICDE \u201914 (2014)","DOI":"10.1109\/ICDE.2014.6816700"},{"key":"64_CR34","doi-asserted-by":"crossref","unstructured":"Lee, D., Park, J., Shim, J., Lee, S.-G.: An efficient similarity join algorithm with cosine similarity predicate. In: Proceedings of the 21st International Conference on Database and Expert Systems Applications: Part II, ser. DEXA\u201910. Berlin, Heidelberg: Springer, pp. 422\u2013436 (2010)","DOI":"10.1007\/978-3-642-15251-1_33"},{"key":"64_CR35","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz, M.: Bounds on lengths of real valued vectors similar with regard to the tanimoto similarity. In: Intelligent Information and Database Systems, ser. Lecture Notes in Computer Science, Selamat, A., Nguyen, N., Haron, H., (eds). Springer, Berlin, 7802, pp. 445\u2013454 (2013)","DOI":"10.1007\/978-3-642-36546-1_46"},{"key":"64_CR36","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz, M.: Using non-zero dimensions for the cosine and tanimoto similarity search among real valued vectors. Fundam. Inform. 127(1\u20134), 307\u2013323 (2013)","DOI":"10.3233\/FI-2013-911"},{"key":"64_CR37","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz, M.: Using non-zero dimensions and lengths of vectors for the tanimoto similarity search among real valued vectors. In: Intelligent Information and Database Systems. Springer, Berlin, pp. 173\u2013182 (2014)","DOI":"10.1007\/978-3-319-05476-6_18"},{"key":"64_CR38","first-page":"361","volume":"5","author":"DD Lewis","year":"2004","unstructured":"Lewis, D.D., Yang, Y., Rose, T.G., Li, F.: Rcv1: a new benchmark collection for text categorization research. J. Mach. Learn. Res. 5, 361\u2013397 (2004)","journal-title":"J. Mach. Learn. Res."},{"issue":"4","key":"64_CR39","doi-asserted-by":"publisher","first-page":"1010","DOI":"10.1021\/ci800426u","volume":"49","author":"N Singh","year":"2009","unstructured":"Singh, N., Guha, R., Giulianotti, M.A., Pinilla, C., Houghten, R.A., Medina-Franco, J.L.: Chemoinformatic analysis of combinatorial libraries, drugs, natural products, and molecular libraries small molecule repository. J. Chem. Inf. Model. 49(4), 1010\u20131024 (2009)","journal-title":"J. Chem. Inf. Model."},{"key":"64_CR40","doi-asserted-by":"publisher","first-page":"D1220","DOI":"10.1093\/nar\/gkv1253","volume":"44","author":"G Papadatos","year":"2016","unstructured":"Papadatos, G., Davies, M., Dedman, N., Chambers, J., Gaulton, A., Siddle, J., Koks, R., Irvine, S.A., Pettersson, J., Goncharoff, N., Hersey, A., Overington, J.P.: Surechembl: a large-scale, chemically annotated patent document database. Nucleic Acids Res. 44, D1220\u2013D1228 (2016)","journal-title":"Nucleic Acids Res."},{"issue":"3","key":"64_CR41","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1108\/eb046814","volume":"14","author":"MF Porter","year":"1980","unstructured":"Porter, M.F.: An algorithm for suffix stripping. Program 14(3), 130\u2013137 (1980)","journal-title":"Program"},{"key":"64_CR42","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1021\/ci700369e","volume":"48","author":"N Wale","year":"2008","unstructured":"Wale, N., Watson, I.A., Karypis, G.: Indirect similarity based methods for effective scaffold-hopping in chemical compounds. J. Chem. Inf. Model. 48, 730\u2013741 (2008)","journal-title":"J. Chem. Inf. Model."},{"key":"64_CR43","doi-asserted-by":"crossref","unstructured":"Wale, N., Karypis, G.: Acyclic subgraph based descriptor spaces for chemical compound retrieval and classification. In: Proceedings of the Sixth International Conference on Data Mining, ser. ICDM \u201906 (2006)","DOI":"10.1109\/ICDM.2006.39"},{"issue":"1","key":"64_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1758-2946-3-1","volume":"3","author":"NM O\u2019Boyle","year":"2011","unstructured":"O\u2019Boyle, N.M., Banck, M., James, C.A., Morley, C., Vandermeersch, T., Hutchison, G.R.: Open babel: an open chemical toolbox. J. Cheminform. 3(1), 1\u201314 (2011)","journal-title":"J. Cheminform."},{"key":"64_CR45","doi-asserted-by":"crossref","unstructured":"Dong, W., Moses, C., Li, K.: Efficient k-nearest neighbor graph construction for generic similarity measures. In: Proceedings of the 20th International Conference on World Wide Web, ser. WWW \u201911. New York: ACM, pp. 577\u2013586 (2011)","DOI":"10.1145\/1963405.1963487"},{"key":"64_CR46","doi-asserted-by":"crossref","unstructured":"Park, Y., Park, S., Lee, S.-G., Jung, W.: Greedy filtering: a scalable algorithm for k-nearest neighbor graph construction. In: Database Systems for Advanced Applications, ser. Lecture Notes in Computer Science. Springer, Berlin 8421, pp. 327\u2013341 (2014)","DOI":"10.1007\/978-3-319-05810-8_22"},{"key":"64_CR47","unstructured":"Awekar, A., Samatova, N.F.: Parallel all pairs similarity search. In: Proceedings of the 10th International Conference on Information and Knowledge Engineering, ser. IKE \u201911 (2011)"},{"key":"64_CR48","unstructured":"Anastasiu, D.C., Karypis, G.: Pl2ap: fast parallel cosine similarity search. In: Proceedings of the 5th Workshop on Irregular Applications: Architectures and Algorithms, in conjunction with SC\u201915, ser. IA3. New York: ACM, 2015, pp. 1\u20138 (2015)"},{"key":"64_CR49","doi-asserted-by":"crossref","unstructured":"Anastasiu, D.C., Karypis, G.: Fast parallel cosine k-nearest neighbor graph construction. In: Proceedings of the 6th Workshop on Irregular Applications: Architectures and Algorithms, in Conjunction with SC\u201916, ser. IA3 2016. New York: ACM (2016)","DOI":"10.1109\/IA3.2016.013"}],"container-title":["International Journal of Data Science and Analytics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s41060-017-0064-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-017-0064-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-017-0064-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,25]],"date-time":"2024-06-25T23:02:34Z","timestamp":1719356554000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s41060-017-0064-z"}},"subtitle":["All-pairs similarity search using the extended Jaccard coefficient"],"short-title":[],"issued":{"date-parts":[[2017,8,2]]},"references-count":49,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["64"],"URL":"https:\/\/doi.org\/10.1007\/s41060-017-0064-z","relation":{},"ISSN":["2364-415X","2364-4168"],"issn-type":[{"value":"2364-415X","type":"print"},{"value":"2364-4168","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,8,2]]},"assertion":[{"value":"26 December 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 July 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 August 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}