{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T13:51:48Z","timestamp":1698846708891},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s11390-016-1618-6","type":"journal-article","created":{"date-parts":[[2016,1,7]],"date-time":"2016-01-07T16:56:00Z","timestamp":1452185760000},"page":"147-166","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["AS-Index: A Structure for String Search Using n-Grams and Algebraic Signatures"],"prefix":"10.1007","volume":"31","author":[{"given":"Camelia","family":"Constantin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C\u00e9dric","family":"du Mouza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Witold","family":"Litwin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Rigaux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Schwarz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,8]]},"reference":[{"key":"1618_CR1","unstructured":"Margaritis G, Anastasiadis S V. SeFS: Unleashing the power of full-text search on file systems. In Proc. the 5th USENIX Conf. File and Storage Technology, Feb. 2007, Article No. 12."},{"issue":"1","key":"1618_CR2","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1145\/234313.234331","volume":"28","author":"M Crochemore","year":"1996","unstructured":"Crochemore M, Lecroq T. Pattern matching and text-compression algorithms. ACM Computing Surveys, 1996, 28(1): 39\u201341.","journal-title":"ACM Computing Surveys"},{"issue":"2","key":"1618_CR3","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1145\/301970.301973","volume":"46","author":"P Ferragina","year":"1999","unstructured":"Ferragina P, Grossi R. The String B-tree: A new data structure for string search in external memory and its applications. J. ACM, 1999, 46(2): 236\u2013280.","journal-title":"J. ACM"},{"key":"1618_CR4","doi-asserted-by":"crossref","unstructured":"Phoophakdee B, Zaki M J. Genome-scale diskbased suffix tree indexing. In Proc. Int. Conf. Management of Data (SIGMOD), June 2007, pp.833-844.","DOI":"10.1145\/1247480.1247572"},{"key":"1618_CR5","unstructured":"Miller E, Shen D, Liu J, Nicholas C. Performance and scalability of a large-scale n-gram based information retrieval system. Journal of Digital Information, 2000."},{"key":"1618_CR6","unstructured":"Kim M S, Whang K, Lee J G, Lee M J. n-Gram\/2L: A space and time efficient two-level n-gram inverted index structure. In Proc. the 31st Int. Conf. Very Large Data Bases (VLDB), Aug. 2005, pp.325-336."},{"key":"1618_CR7","doi-asserted-by":"crossref","unstructured":"Litwin W, Schwarz T. Algebraic signatures for scalable distributed data structures. In Proc. the 20th Int. Conf. Data Engineering (ICDE), March 2004, pp.412-423.","DOI":"10.1109\/ICDE.2004.1320015"},{"key":"1618_CR8","doi-asserted-by":"crossref","unstructured":"du Mouza C, Litwin W, Rigaux P, Schwarz T J E. AS-index: A structure for string search using n-grams and algebraic signatures. In Proc. the 18th Int. Conf. Information and Knowledge Management (CIKM), Nov. 2009, pp.295-304.","DOI":"10.1145\/1645953.1645993"},{"issue":"4","key":"1618_CR9","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/1413254.1413261","volume":"6","author":"J Gray","year":"2008","unstructured":"Gray J, Fitzgerald B. Flash disk opportunity for server applications. ACM Queue, 2008, 6(4): 18\u201323.","journal-title":"ACM Queue"},{"key":"1618_CR10","doi-asserted-by":"crossref","unstructured":"Charras C, Lecroq T, Pehoushek J D. A very fast string matching algorithm for small alphabets and long patterns. In Proc. the 9th Int. Symp. Combinatorial Pattern Matching (CPM), July 1998, pp.55-64.","DOI":"10.1007\/BFb0030780"},{"key":"1618_CR11","unstructured":"Witten I, Moffat A, Bell T. Managing Gigabytes: Compressing and Indexing Documents and Images (1st edition). Morgan-Kaufmann, 1999."},{"key":"1618_CR12","doi-asserted-by":"crossref","unstructured":"Na J C, Park K. Simple implementation of String B-Tree. In Proc. the 11th Int. Conf. String Processing and Information Retrieval (SPIRE), Oct. 2004, pp.214-215.","DOI":"10.1007\/978-3-540-30213-1_31"},{"key":"1618_CR13","unstructured":"Baeza-Yates R, Ribeiro-Neto B. Modern Information Re-trieval. Addison-Wesley, 1999."},{"key":"1618_CR14","unstructured":"Robenek D, Plato\u0161 J, Sn\u00e1\u0161el V. Efficient inmemory data structures for n-grams indexing. In Proc. Int. Work. Databases, Texts, Specifications and Objects (DATESO), April 2013, pp.48-58."},{"key":"1618_CR15","doi-asserted-by":"crossref","unstructured":"Gusfield D. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology (1st edition). Cambridge University Press, 1997.","DOI":"10.1017\/CBO9780511574931"},{"issue":"13","key":"1618_CR16","doi-asserted-by":"crossref","first-page":"1149","DOI":"10.1002\/(SICI)1097-024X(199911)29:13<1149::AID-SPE274>3.0.CO;2-O","volume":"29","author":"S Kurtz","year":"1999","unstructured":"Kurtz S. Reducing the space requirement of suffix trees. Software \u2014 Practice and Experience, 1999, 29(13): 1149\u20131171.","journal-title":"Software \u2014 Practice and Experience"},{"key":"1618_CR17","doi-asserted-by":"crossref","unstructured":"Tata S, Hankins R, Patel J. Practical suffix tree construction. In Proc. the 30th Int. Conf. Very Large Databases (VLDB), Aug. 2004, pp.36-48.","DOI":"10.1016\/B978-012088469-8.50007-3"},{"issue":"5","key":"1618_CR18","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U Manber","year":"1993","unstructured":"Manber U, Myers G. Sufix arrays: A new method for on-line string searches. SIAM Journal on Computing, 1993, 22(5): 935\u2013948.","journal-title":"SIAM Journal on Computing"},{"key":"1618_CR19","doi-asserted-by":"crossref","unstructured":"K\u00e4rkk\u00e4inen J. Suffix cactus: A cross between suffix tree and suffix array. In Proc. the 6th Int. Symp. Combinatorial Pattern Matching (CPM), July 1995, pp.191-204.","DOI":"10.1007\/3-540-60044-2_43"},{"issue":"2","key":"1618_CR20","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/spe.4380250203","volume":"25","author":"A Andersson","year":"1995","unstructured":"Andersson A, Nilsson S. Efficient implementation of suffix trees. Software \u2014 Practice and Experience, 1995, 25(2): 129\u2013141.","journal-title":"Software \u2014 Practice and Experience"},{"key":"1618_CR21","doi-asserted-by":"crossref","unstructured":"Dementiev R, K\u00e4rkk\u00e4inen J, Mehnert J, Sanders P. Better external memory suffix array construction. ACM Journal of Experimental Algorithmics, 2008, 12: Article No. 3.4.","DOI":"10.1145\/1227161.1402296"},{"key":"1618_CR22","doi-asserted-by":"crossref","unstructured":"Barsky M, Thomo A, Stege U. Full-Text (Substring) Indexes in External Memory. Morgan & Claypool Publishers, 2011.","DOI":"10.2200\/S00396ED1V01Y201111DTM022"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-016-1618-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-016-1618-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-016-1618-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T07:50:50Z","timestamp":1567497050000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-016-1618-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["1618"],"URL":"https:\/\/doi.org\/10.1007\/s11390-016-1618-6","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1]]}}}