{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:20Z","timestamp":1740109280834,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,11,6]],"date-time":"2015-11-06T00:00:00Z","timestamp":1446768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"NGFR973","award":["2012CB316200"],"award-info":[{"award-number":["2012CB316200"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China (CN)","doi-asserted-by":"publisher","award":["61472099"],"award-info":[{"award-number":["61472099"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China (CN)","doi-asserted-by":"publisher","award":["61133002"],"award-info":[{"award-number":["61133002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Sci-Tech Support Plan","award":["2015BAH10F00"],"award-info":[{"award-number":["2015BAH10F00"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s10115-015-0896-6","type":"journal-article","created":{"date-parts":[[2015,11,6]],"date-time":"2015-11-06T06:51:31Z","timestamp":1446792691000},"page":"121-141","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An efficient pruning strategy for approximate string matching over suffix tree"],"prefix":"10.1007","volume":"49","author":[{"given":"Huan","family":"Hu","sequence":"first","affiliation":[]},{"given":"Hongzhi","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Jianzhong","family":"Li","sequence":"additional","affiliation":[]},{"given":"Hong","family":"Gao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,6]]},"reference":[{"key":"896_CR1","doi-asserted-by":"crossref","unstructured":"Baeza-Yates RA, Gonnet GH (1999) A fast algorithm on average for all-against-all sequence matching. In: SPIRE\/CRIWG. pp 16\u201323","DOI":"10.1109\/SPIRE.1999.796573"},{"issue":"2","key":"896_CR2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/PL00009253","volume":"23","author":"RA Baeza-Yates","year":"1999","unstructured":"Baeza-Yates RA, Navarro G (1999) Faster approximate string matching. Algorithmica 23(2):127\u2013158","journal-title":"Algorithmica"},{"key":"896_CR3","doi-asserted-by":"publisher","unstructured":"Boytsov L (2011) Indexing methods for approximate dictionary searching: comparative analysis. ACM J Exp Algorithmics 16:1.1:1.1\u20131.1:1.91. doi: 10.1145\/1963190.1963191","DOI":"10.1145\/1963190.1963191"},{"issue":"12","key":"896_CR4","doi-asserted-by":"crossref","first-page":"1797","DOI":"10.1016\/0031-3203(93)90177-X","volume":"26","author":"H Bunke","year":"1993","unstructured":"Bunke H, B\u00fchler U (1993) Applications of approximate string matching to 2d shape recognition. Pattern Recognit 26(12):1797\u20131812","journal-title":"Pattern Recognit"},{"key":"896_CR5","doi-asserted-by":"crossref","unstructured":"Chang WI, Lampe J (1992) Theoretical and empirical comparisons of approximate string matching algorithms. In: Combinatorial pattern matching, third annual symposium, CPM 92, Tucson, Arizona, USA, April 29\u2013May 1 1992, Proceedings, pp 175\u2013184","DOI":"10.1007\/3-540-56024-6_14"},{"key":"896_CR6","unstructured":"Danek A, Deorowicz S, Grabowski S (2014) Indexing large genome collections on a PC. In: CoRR. arXiv:1403.7481"},{"key":"896_CR7","doi-asserted-by":"crossref","unstructured":"French JC, Powell AL, Schulman E (1997) Applications of approximate word matching in information retrieval. In: Proceedings of the sixth international conference on information and knowledge management (CIKM\u201997), Las Vegas, Nevada, November 10\u201314 1997, pp 9\u201315","DOI":"10.1145\/266714.266721"},{"issue":"2","key":"896_CR8","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","volume":"29","author":"RW Hamming","year":"1950","unstructured":"Hamming RW (1950) Error detecting and error correcting codes. Bell Syst Tech J 29(2):147\u2013160","journal-title":"Bell Syst Tech J"},{"key":"896_CR9","doi-asserted-by":"publisher","unstructured":"Hyyr\u00f6 H, Fredriksson K, Navarro G (2005) Increased bit-parallelism for approximate and multiple string matching. J Exp Algorithmics 10:2.6. doi: 10.1145\/1064546.1180617","DOI":"10.1145\/1064546.1180617"},{"key":"896_CR10","first-page":"707","volume":"10","author":"VI Levenshtein","year":"1966","unstructured":"Levenshtein VI (1966) Binary codes capable of correcting deletions, insertions, and reversals. Sov Phys Dokl 10:707\u2013710","journal-title":"Sov Phys Dokl"},{"issue":"1","key":"896_CR11","doi-asserted-by":"crossref","first-page":"019901","DOI":"10.1117\/1.2179076","volume":"15","author":"S Mitra","year":"2006","unstructured":"Mitra S, Acharya T, Luo J (2006) Data mining: multimedia, soft computing, and bioinformatics. J. Electron Imaging 15(1):019901","journal-title":"J. Electron Imaging"},{"issue":"1","key":"896_CR12","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G Navarro","year":"2001","unstructured":"Navarro G (2001) A guided tour to approximate string matching. ACM Comput Surv 33(1):31\u201388","journal-title":"ACM Comput Surv"},{"issue":"1","key":"896_CR13","first-page":"205","volume":"1","author":"G Navarro","year":"2000","unstructured":"Navarro G, Baeza-Yates R (2000) A hybrid indexing method for approximate string matching. J Discrete Algorithms 1(1):205\u2013239","journal-title":"J Discrete Algorithms"},{"key":"896_CR14","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781316135228","volume-title":"Flexible pattern matching in strings: practical on-line search algorithms for texts and biological sequences","author":"G Navarro","year":"2002","unstructured":"Navarro G, Raffinot M (2002) Flexible pattern matching in strings: practical on-line search algorithms for texts and biological sequences. Cambridge University Press, Cambridge"},{"issue":"4","key":"896_CR15","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0196-6774(80)90016-4","volume":"1","author":"PH Sellers","year":"1980","unstructured":"Sellers PH (1980) The theory and computation of evolutionary distances: pattern recognition. J Algorithms 1(4):359\u2013373","journal-title":"J Algorithms"},{"key":"896_CR16","unstructured":"Typke R, Wiering F, Veltkamp RC (2005) A survey of music information retrieval systems. In: ISMIR 2005, 6th international conference on music information retrieval, London, UK, 11\u201315 Sept 2005, Proceedings, pp 153\u2013160"},{"issue":"1","key":"896_CR17","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0196-6774(85)90023-9","volume":"6","author":"E Ukkonen","year":"1985","unstructured":"Ukkonen E (1985) Finding approximate patterns in strings. J Algorithms 6(1):132\u2013137","journal-title":"J Algorithms"},{"key":"896_CR18","doi-asserted-by":"crossref","unstructured":"Ukkonen E (1993) Approximate string-matching over suffix trees. In: Combinatorial pattern matching, 4th annual symposium, CPM 93, Padova, Italy, 2\u20134 June 1993, Proceedings, pp 228\u2013242","DOI":"10.1007\/BFb0029808"},{"issue":"3","key":"896_CR19","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E Ukkonen","year":"1995","unstructured":"Ukkonen E (1995) On-line construction of suffix trees. Algorithmica 14(3):249\u2013260","journal-title":"Algorithmica"},{"issue":"13","key":"896_CR20","first-page":"1534","volume":"6","author":"S Wandelt","year":"2013","unstructured":"Wandelt S, Starlinger J, Bux M, Leser U (2013) RCSI: scalable similarity search in thousand(s) of genomes. PVLDB 6(13):1534\u20131545","journal-title":"PVLDB"},{"issue":"10","key":"896_CR21","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1145\/135239.135244","volume":"35","author":"S Wu","year":"1992","unstructured":"Wu S, Manber U (1992) Fast text searching allowing errors. Commun ACM 35(10):83\u201391","journal-title":"Commun ACM"},{"key":"896_CR22","unstructured":"Yang X, Wang B, Li C, Wang J, Xie X (2013) Efficient direct search on compressed genomic data. In: 29th IEEE international conference on data engineering, ICDE 2013, Brisbane, Australia, 8\u201312 April 2013, pp 961\u2013972"},{"key":"896_CR23","doi-asserted-by":"crossref","unstructured":"Zhang Q, Chamberlain RD, Indeck RS, West BM, White J (2004) Massively parallel data mining using reconfigurable hardware: approximate string matching. In: 18th International parallel and distributed processing symposium (IPDPS 2004) CD-ROM\/Abstracts proceedings, 26\u201330 April 2004. Santa Fe, New Mexico, USA","DOI":"10.1109\/IPDPS.2004.1303326"},{"key":"896_CR24","doi-asserted-by":"crossref","unstructured":"Zobel J, Dart PW (1996) Phonetic string matching: lessons from information retrieval. In: Proceedings of the 19th annual international ACM SIGIR conference on research and development in information retrieval, SIGIR\u201996, 18\u201322 August 1996, Zurich, Switzerland (Special Issue of the SIGIR Forum), pp 166\u2013172","DOI":"10.1145\/243199.243258"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0896-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-015-0896-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0896-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0896-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T06:11:19Z","timestamp":1559110279000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-015-0896-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,6]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["896"],"URL":"https:\/\/doi.org\/10.1007\/s10115-015-0896-6","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2015,11,6]]}}}