{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:25:53Z","timestamp":1725852353258},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319320243"},{"type":"electronic","value":"9783319320250"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-32025-0_31","type":"book-chapter","created":{"date-parts":[[2016,3,24]],"date-time":"2016-03-24T12:47:38Z","timestamp":1458823658000},"page":"501-516","source":"Crossref","is-referenced-by-count":4,"title":["An Adaptive Approach of Approximate Substring Matching"],"prefix":"10.1007","author":[{"given":"Jiaying","family":"Wang","sequence":"first","affiliation":[]},{"given":"Xiaochun","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Bin","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Chengfei","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,25]]},"reference":[{"key":"31_CR1","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, pp. 131\u2013140. ACM (2007)","DOI":"10.1145\/1242572.1242591"},{"key":"31_CR2","volume-title":"Fast similarity search in large dictionaries","author":"T Bocek","year":"2007","unstructured":"Bocek, T., Hunt, E., Stiller, B., Hecht, F.: Fast similarity search in large dictionaries. University of Zurich, Zurich (2007)"},{"key":"31_CR3","unstructured":"Burrows, M., Wheeler, D.J.: A block-sorting lossless data compression algorithm (1994)"},{"key":"31_CR4","doi-asserted-by":"crossref","unstructured":"Deng, D., Li, G., Feng, J.: A pivotal prefix based filtering algorithm for string similarity search. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, pp. 673\u2013684. ACM (2014)","DOI":"10.1145\/2588555.2593675"},{"key":"31_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-642-31235-9_18","volume-title":"Scientific and Statistical Database Management","author":"D Fenz","year":"2012","unstructured":"Fenz, D., Lange, D., Rheinl\u00e4nder, A., Naumann, F., Leser, U.: Efficient similarity search in very large string sets. In: Ailamaki, A., Bowers, S. (eds.) SSDBM 2012. LNCS, vol. 7338, pp. 262\u2013279. Springer, Heidelberg (2012)"},{"key":"31_CR6","unstructured":"Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000, pp. 390\u2013398. IEEE (2000)"},{"key":"31_CR7","first-page":"1","volume":"9","author":"K Fredriksson","year":"2004","unstructured":"Fredriksson, K., Navarro, G.: Average-optimal single and multiple approximate string matching. J. Exp. Algorithmics (JEA) 9, 1\u20134 (2004)","journal-title":"J. Exp. Algorithmics (JEA)"},{"key":"31_CR8","unstructured":"Gravano, L., Ipeirotis, P.G., Jagadish, H.V., Koudas, N., Muthukrishnan, S., Srivastava, D.: Approximate string joins in a database (almost) for free. In: VLDB, pp. 491\u2013500 (2001)"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"Jiang, Y., Deng, D., Wang, J., Li, G., Feng, J.: Efficient parallel partition-based algorithms for similarity search and join with edit distance constraints. In: Proceedings of the Joint EDBT\/ICDT 2013 Workshops, pp. 341\u2013348. ACM (2013)","DOI":"10.1145\/2457317.2457382"},{"key":"31_CR10","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.ins.2013.04.037","volume":"244","author":"Y Kim","year":"2013","unstructured":"Kim, Y., Park, H., Shim, K., Woo, K.G.: Efficient processing of substring match queries with inverted variable-length gram indexes. Inf. Sci. 244, 119\u2013141 (2013)","journal-title":"Inf. Sci."},{"key":"31_CR11","unstructured":"Li, C., Wang, B., Yang, X.: Vgram: Improving performance of approximate queries on string collections using variable-length grams. In: VLDB, pp. 303\u2013314 (2007)"},{"issue":"3","key":"31_CR12","doi-asserted-by":"publisher","first-page":"253","DOI":"10.14778\/2078331.2078340","volume":"5","author":"G Li","year":"2011","unstructured":"Li, G., Deng, D., Wang, J., Feng, J.: Pass-join: a partition-based method for similarity joins. Proc. VLDB Endowment 5(3), 253\u2013264 (2011)","journal-title":"Proc. VLDB Endowment"},{"issue":"14","key":"31_CR13","doi-asserted-by":"publisher","first-page":"1754","DOI":"10.1093\/bioinformatics\/btp324","volume":"25","author":"H Li","year":"2009","unstructured":"Li, H., Durbin, R.: Fast and accurate short read alignment with burrows-wheeler transform. Bioinformatics 25(14), 1754\u20131760 (2009)","journal-title":"Bioinformatics"},{"issue":"5","key":"31_CR14","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1093\/bioinformatics\/btp698","volume":"26","author":"H Li","year":"2010","unstructured":"Li, H., Durbin, R.: Fast and accurate long-read alignment with burrows-wheeler transform. Bioinformatics 26(5), 589\u2013595 (2010)","journal-title":"Bioinformatics"},{"issue":"1","key":"31_CR15","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G Navarro","year":"2001","unstructured":"Navarro, G.: A guided tour to approximate string matching. ACM Comput. Surv. 33(1), 31\u201388 (2001)","journal-title":"ACM Comput. Surv."},{"issue":"1","key":"31_CR16","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1216370.1216372","volume":"39","author":"G Navarro","year":"2007","unstructured":"Navarro, G., M\u00e4kinen, V.: Compressed full-text indexes. ACM Comput. Surv. (CSUR) 39(1), 2 (2007)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"31_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/3-540-45123-4_29","volume-title":"Combinatorial Pattern Matching","author":"G Navarro","year":"2000","unstructured":"Navarro, G., Sutinen, E., Tanninen, J., Tarhio, J.: Indexing text with approximate q-grams. In: Giancarlo, R., Sankoff, D. (eds.) CPM 2000. LNCS, vol. 1848, pp. 350\u2013363. Springer, Heidelberg (2000)"},{"key":"31_CR18","doi-asserted-by":"crossref","unstructured":"Qin, J., Wang, W., Lu, Y., Xiao, C., Lin, X.: Efficient exact edit similarity query processing with the asymmetric signature scheme. In: SIGMOD Conference, pp. 1033\u20131044 (2011)","DOI":"10.1145\/1989323.1989431"},{"key":"31_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/BFb0029808","volume-title":"Combinatorial Pattern Matching","author":"E Ukkonen","year":"1993","unstructured":"Ukkonen, E.: Approximate string-matching over suffix trees. In: Apostolico, A., Crochemore, M., Galil, Z., Manber, U. (eds.) CPM 1993. LNCS, vol. 684, pp. 228\u2013242. Springer, Heidelberg (1993)"},{"issue":"1","key":"31_CR20","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1145\/2627692.2627706","volume":"43","author":"S Wandelt","year":"2014","unstructured":"Wandelt, S., Deng, D., Gerdjikov, S., Mishra, S., Mitankin, P., Patil, M., Siragusa, E., Tiskin, A., Wang, W., Wang, J., et al.: State-of-the-art in string similarity search and join. ACM SIGMOD Rec. 43(1), 64\u201376 (2014)","journal-title":"ACM SIGMOD Rec."},{"key":"31_CR21","doi-asserted-by":"crossref","unstructured":"Wang, J., Li, G., Feng, J.: Can we beat the prefix filtering?: an adaptive framework for similarity join and search. In: SIGMOD Conference, pp. 85\u201396 (2012)","DOI":"10.1145\/2213836.2213847"},{"key":"31_CR22","doi-asserted-by":"crossref","unstructured":"Wang, J., Yang, X., Wang, B.: Cache-aware parallel approximate matching and join algorithms using bwt. In: Proceedings of the Joint EDBT\/ICDT 2013 Workshops, pp. 404\u2013412. ACM (2013)","DOI":"10.1145\/2457317.2457391"},{"key":"31_CR23","doi-asserted-by":"crossref","unstructured":"Yang, X., Wang, B., Li, C.: Cost-based variable-length-gram selection for string collections to support approximate queries efficiently. In: SIGMOD Conference, pp. 353\u2013364 (2008)","DOI":"10.1145\/1376616.1376655"},{"key":"31_CR24","unstructured":"Yang, X., Wang, B., Li, C., Wang, J., Xie, X.: Efficient direct search on compressed genomic data. In: 29th IEEE International Conference on Data Engineering, ICDE 2013, Brisbane, Australia, April 8\u201312, 2013, pp. 961\u2013972 (2013)"},{"key":"31_CR25","doi-asserted-by":"crossref","unstructured":"Yang, X., Wang, Y., Wang, B., Wang, W.: Local filtering: Improving the performance of approximate queries on string collections. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp. 377\u2013392. ACM (2015)","DOI":"10.1145\/2723372.2749445"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-32025-0_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T22:00:20Z","timestamp":1559426420000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-32025-0_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319320243","9783319320250"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-32025-0_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}