{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:46:02Z","timestamp":1740181562372,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,12,17]],"date-time":"2022-12-17T00:00:00Z","timestamp":1671235200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,17]],"date-time":"2022-12-17T00:00:00Z","timestamp":1671235200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"DOI":"10.1007\/s42979-022-01502-5","type":"journal-article","created":{"date-parts":[[2022,12,17]],"date-time":"2022-12-17T10:02:53Z","timestamp":1671271373000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Extending the Bag Distance for String Similarity Search"],"prefix":"10.1007","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9005-4322","authenticated-orcid":false,"given":"S\u00e9rgio","family":"Mergen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,17]]},"reference":[{"issue":"1","key":"1502_CR1","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/s007780200060","volume":"11","author":"G Navarro","year":"2002","unstructured":"Navarro G. Searching in metric spaces by spatial approximation. VLDB J. 2002;11(1):28\u201346.","journal-title":"VLDB J"},{"issue":"4","key":"1502_CR2","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1016\/j.is.2010.10.002","volume":"36","author":"D Novak","year":"2011","unstructured":"Novak D, Batko M, Zezula P. Metric index: an efficient and scalable solution for precise and approximate similarity search. Inf Syst. 2011;36(4):721\u201333.","journal-title":"Inf Syst"},{"issue":"10","key":"1502_CR3","doi-asserted-by":"publisher","first-page":"1058","DOI":"10.14778\/3115404.3115411","volume":"10","author":"L Chen","year":"2017","unstructured":"Chen L, Gao Y, Zheng B, Jensen CS, Yang H, Yang K. Pivot-based metric indexing. Proc VLDB Endow. 2017;10(10):1058\u201369.","journal-title":"Proc VLDB Endow"},{"unstructured":"Levenshtein VI. Binary codes capable of correcting deletions, insertions, and reversals. In: Soviet Physics Doklady, vol. 10. 1966. p. 707\u201310.","key":"1502_CR4"},{"issue":"4","key":"1502_CR5","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s00778-005-0178-0","volume":"16","author":"C Traina Jr","year":"2007","unstructured":"Traina C Jr, Traina AJ, Vieira MR, Faloutsos C, et al. The omni-family of all-purpose access methods: a simple and effective way to make similarity search more efficient. VLDB J-Int J Very Large Data Bases. 2007;16(4):483\u2013505.","journal-title":"VLDB J-Int J Very Large Data Bases"},{"doi-asserted-by":"crossref","unstructured":"Traina C, Traina A, Seeger B, Faloutsos C. Slim-trees: High performance metric trees minimizing overlap between nodes. In: International conference on extending database technology. Springer; 2000. p. 51\u201365.","key":"1502_CR6","DOI":"10.1007\/3-540-46439-5_4"},{"issue":"10","key":"1502_CR7","doi-asserted-by":"publisher","first-page":"828","DOI":"10.14778\/2977797.2977808","volume":"9","author":"D Deng","year":"2016","unstructured":"Deng D, Li G, Wen H, Jagadish H, Feng J. Meta: an efficient matching-based method for error-tolerant autocompletion. Proc VLDB Endow. 2016;9(10):828\u201339.","journal-title":"Proc VLDB Endow"},{"key":"1502_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-29151-2","volume-title":"Similarity search: the metric space approach","author":"P Zezula","year":"2006","unstructured":"Zezula P, Amato G, Dohnal V, Batko M. Similarity search: the metric space approach, vol. 32. London: Springer; 2006."},{"doi-asserted-by":"crossref","unstructured":"Bartolini I, Ciaccia P, Patella M. String matching with metric trees using an approximate distance. In: Proceedings of the 9th international symposium on string processing and information retrieval. SPIRE 2002. London: Springer. 2002. p. 271\u201383. http:\/\/dl.acm.org\/citation.cfm?id=646491.694971","key":"1502_CR9","DOI":"10.1007\/3-540-45735-6_24"},{"issue":"9","key":"1502_CR10","doi-asserted-by":"publisher","first-page":"1363","DOI":"10.1016\/j.patrec.2004.11.014","volume":"26","author":"E Ch\u00e1vez","year":"2005","unstructured":"Ch\u00e1vez E, Navarro G. A compact space decomposition for effective metric indexing. Pattern Recogn Lett. 2005;26(9):1363\u201376.","journal-title":"Pattern Recogn Lett"},{"doi-asserted-by":"crossref","unstructured":"Deza MM, Deza E. Encyclopedia of distances. In: Encyclopedia of distances. London: Springer. 2009. p. 1\u2013583.","key":"1502_CR11","DOI":"10.1007\/978-3-642-00234-2_1"},{"issue":"3","key":"1502_CR12","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","volume":"48","author":"SB Needleman","year":"1970","unstructured":"Needleman SB, Wunsch CD. A general method applicable to the search for similarities in the amino acid sequence of two proteins. J Mol Biol. 1970;48(3):443\u201353.","journal-title":"J Mol Biol"},{"issue":"1","key":"1502_CR13","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1186\/1471-2105-10-S1-S10","volume":"10","author":"D Papamichail","year":"2009","unstructured":"Papamichail D, Papamichail G. Improved algorithms for approximate string matching. BMC Bioinform. 2009;10(1):10.","journal-title":"BMC Bioinform"},{"doi-asserted-by":"crossref","unstructured":"Li H, Ni B, Wong M-H, Leung K-S. A fast cuda implementation of agrep algorithm for approximate nucleotide sequence matching. In: Application specific processors (SASP), 2011 IEEE 9th symposium on. IEEE. 2011. p. 74\u20137.","key":"1502_CR14","DOI":"10.1109\/SASP.2011.5941082"},{"unstructured":"Kahveci T, Singh AK. An efficient index structure for string databases. In: VLDB, vol. 1. 2001. p. 351\u201360.","key":"1502_CR15"},{"issue":"1","key":"1502_CR16","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s10044-008-0141-y","volume":"13","author":"X Gao","year":"2010","unstructured":"Gao X, Xiao B, Tao D, Li X. A survey of graph edit distance. Pattern Anal Appl. 2010;13(1):113\u201329.","journal-title":"Pattern Anal Appl"},{"issue":"4","key":"1502_CR17","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0167-8655(83)90033-8","volume":"1","author":"H Bunke","year":"1983","unstructured":"Bunke H, Allermann G. Inexact graph matching for structural pattern recognition. Pattern Recogn Lett. 1983;1(4):245\u201353.","journal-title":"Pattern Recogn Lett"},{"issue":"1","key":"1502_CR18","doi-asserted-by":"publisher","first-page":"25","DOI":"10.14778\/1687627.1687631","volume":"2","author":"Z Zeng","year":"2009","unstructured":"Zeng Z, Tung AK, Wang J, Feng J, Zhou L. Comparing stars: on approximating graph edit distance. Proc VLDB Endow. 2009;2(1):25\u201336.","journal-title":"Proc VLDB Endow"},{"issue":"02","key":"1502_CR19","doi-asserted-by":"publisher","first-page":"1550010","DOI":"10.1142\/S021800141550010X","volume":"29","author":"F Serratosa","year":"2015","unstructured":"Serratosa F. Speeding up fast bipartite graph matching through a new cost matrix. Int J Pattern Recogn Artif Intell. 2015;29(02):1550010.","journal-title":"Int J Pattern Recogn Artif Intell"},{"key":"1502_CR20","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.patrec.2018.03.032","volume":"134","author":"S Bougleux","year":"2018","unstructured":"Bougleux S, Ga\u00fcz\u00e8re B, Blumenthal DB, Brun L. Fast linear sum assignment with error-correction and no cost constraints. Pattern Recogn Lett. 2018;134:37\u201345.","journal-title":"Pattern Recogn Lett"},{"issue":"1\u20133","key":"1502_CR21","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/S0019-9958(85)80046-2","volume":"64","author":"E Ukkonen","year":"1985","unstructured":"Ukkonen E. Algorithms for approximate string matching. Inf Control. 1985;64(1\u20133):100\u201318.","journal-title":"Inf Control"},{"doi-asserted-by":"crossref","unstructured":"Chen L, Gao Y, Li X, Jensen CS, Chen G. Efficient metric indexing for similarity search. In: Data engineering (ICDE), 2015 IEEE 31st international conference on. IEEE. 2015. p. 591\u2013602.","key":"1502_CR22","DOI":"10.1109\/ICDE.2015.7113317"},{"unstructured":"Figueroa K, Navarro G, Ch\u00e1vez E. Metric Spaces Library. 2007. Available at http:\/\/www.sisap.org\/Metric_Space_Library.html.","key":"1502_CR23"},{"unstructured":"Lee H, Ng RT, Shim K. Extending q-grams to estimate selectivity of string matching with low edit distance. In: Proceedings of the 33rd international conference on very large data bases. VLDB Endowment. 2007. p. 195\u2013206.","key":"1502_CR24"},{"issue":"2","key":"1502_CR25","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1109\/69.991715","volume":"14","author":"C Traina","year":"2002","unstructured":"Traina C, Traina A, Faloutsos C, Seeger B. Fast indexing and visualization of metric data sets using slim-trees. IEEE Trans Knowl Data Eng. 2002;14(2):244\u201360.","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"4","key":"1502_CR26","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1145\/362003.362025","volume":"16","author":"WA Burkhard","year":"1973","unstructured":"Burkhard WA, Keller RM. Some approaches to best-match file searching. Commun ACM. 1973;16(4):230\u20136.","journal-title":"Commun ACM"},{"unstructured":"Yianilos PN. Data structures and algorithms for nearest neighbor search in general metric spaces. In: SODA, vol. 93. 1993. p. 311\u201321.","key":"1502_CR27"},{"doi-asserted-by":"crossref","unstructured":"Bozkaya T, Ozsoyoglu M. Distance-based indexing for high-dimensional metric spaces. In: ACM SIGMOD Record, vol. 26. ACM. 1997. p. 357\u201368.","key":"1502_CR28","DOI":"10.1145\/253262.253345"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01502-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-022-01502-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01502-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,10]],"date-time":"2023-03-10T11:37:45Z","timestamp":1678448265000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-022-01502-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,17]]},"references-count":28,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2023,3]]}},"alternative-id":["1502"],"URL":"https:\/\/doi.org\/10.1007\/s42979-022-01502-5","relation":{},"ISSN":["2661-8907"],"issn-type":[{"type":"electronic","value":"2661-8907"}],"subject":[],"published":{"date-parts":[[2022,12,17]]},"assertion":[{"value":"30 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 November 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 December 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author declares that he has no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by the author.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"No individual participate, in any form, in the elaboration of the paper.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Information consent"}}],"article-number":"95"}}