{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:14:49Z","timestamp":1759637689859},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642163203"},{"type":"electronic","value":"9783642163210"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16321-0_6","type":"book-chapter","created":{"date-parts":[[2010,10,5]],"date-time":"2010-10-05T10:51:32Z","timestamp":1286275892000},"page":"55-66","source":"Crossref","is-referenced-by-count":11,"title":["String Retrieval for Multi-pattern Queries"],"prefix":"10.1007","author":[{"given":"Wing-Kai","family":"Hon","sequence":"first","affiliation":[]},{"given":"Rahul","family":"Shah","sequence":"additional","affiliation":[]},{"given":"Sharma V.","family":"Thankachan","sequence":"additional","affiliation":[]},{"given":"Jeffrey Scott","family":"Vitter","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/10719839_9","volume-title":"LATIN 2000: Theoretical Informatics","author":"M.A. Bender","year":"2000","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA Problem Revisited. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol.\u00a01776, pp. 88\u201394. Springer, Heidelberg (2000)"},{"issue":"1-7","key":"6_CR2","first-page":"107","volume":"30","author":"S. Brin","year":"1998","unstructured":"Brin, S., Page, L.: The Anatomy of a Large-Scale Hypertextual Web Search Engine. Computer Networks\u00a030(1-7), 107\u2013117 (1998)","journal-title":"Computer Networks"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Cohen, H., Porat, E.: Fast Set Intersection and Two Patterns Matching. In: LATIN (2010)","DOI":"10.1007\/978-3-642-12200-2_22"},{"issue":"8","key":"6_CR4","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1016\/j.ic.2008.12.010","volume":"207","author":"P. Ferragina","year":"2009","unstructured":"Ferragina, P., Giancarlo, R., Manzini, G.: The Myriad Virtues of Wavelet Trees. Inf. and Comp.\u00a0207(8), 849\u2013866 (2009)","journal-title":"Inf. and Comp."},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Manzini, G., M\u00e4kinen, V., Navarro, G.: Compressed representations of sequences and full-text indexes. ACM Transactions on Algorithms (TALG)\u00a03(2) (2007)","DOI":"10.1145\/1240233.1240243"},{"key":"6_CR6","unstructured":"Grossi, R., Gupta, A., Vitter, J.S.: High-Order Entropy-Compressed Text Indexes. In: SODA, pp. 841\u2013850 (2003)"},{"issue":"2","key":"6_CR7","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1137\/S0097539702402354","volume":"35","author":"R. Grossi","year":"2005","unstructured":"Grossi, R., Vitter, J.S.: Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching. SICOMP\u00a035(2), 378\u2013407 (2005)","journal-title":"SICOMP"},{"key":"6_CR8","unstructured":"Hon, W.K., Shah, R., Vitter, J.S.: Ordered Pattern Matching: Towards Full-Text Retrieval. Tech Report TR-06-008, Dept. of CS, Purdue University (2006)"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Hon, W.K., Shah, R., Vitter, J.S.: Space-Efficient Framework for Top-k String Retrival Problems. In: FOCS, pp. 713\u2013722 (2009)","DOI":"10.1109\/FOCS.2009.19"},{"issue":"3","key":"6_CR10","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1016\/j.tcs.2007.07.013","volume":"387","author":"V. M\u00e4kinen","year":"2007","unstructured":"M\u00e4kinen, V., Navarro, G.: Rank and Selected Revisited and Extended. TCS\u00a0387(3), 332\u2013347 (2007)","journal-title":"TCS"},{"issue":"5","key":"6_CR11","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"Manber, U., Myers, G.: Suffix Arrays: A New Method for On-Line String Searches. SICOMP\u00a022(5), 935\u2013948 (1993)","journal-title":"SICOMP"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/3-540-68530-8_6","volume-title":"Algorithms - ESA \u201998","author":"Y. Matias","year":"1998","unstructured":"Matias, Y., Muthukrishnan, S., Sahinalp, S.C., Ziv, J.: Augmenting Suffix Trees, with Applications. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol.\u00a01461, pp. 67\u201378. Springer, Heidelberg (1998)"},{"issue":"3","key":"6_CR13","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1137\/S0097539799364092","volume":"31","author":"J.I. Munro","year":"2001","unstructured":"Munro, J.I., Raman, V.: Succinct Representation of Balanced Parentheses and Static Trees. SICOMP\u00a031(3), 762\u2013776 (2001)","journal-title":"SICOMP"},{"key":"6_CR14","unstructured":"Muthukrishnan, S.: Efficient Algorithms for Document Retrieval Problems. In: SODA, pp. 657\u2013666 (2002)"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Raman, R., Raman, V., Rao, S.S.: Succinct Indexable Dictionaries with Applications to Encoding k-ary Trees, Prefix Sums and Multisets. TALG\u00a03(4) (2007)","DOI":"10.1145\/1290672.1290680"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Sadakane, K.: Compressed Suffix Trees with Full Functionality. TCS, 589\u2013607 (2007)","DOI":"10.1007\/s00224-006-1198-x"},{"issue":"1","key":"6_CR17","first-page":"12","volume":"5","author":"K. Sadakane","year":"2007","unstructured":"Sadakane, K.: Succinct Data Structures for Flexible Text Retrieval Systems. JDA\u00a05(1), 12\u201322 (2007)","journal-title":"JDA"},{"key":"6_CR18","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-540-73437-6_22","volume-title":"Combinatorial Pattern Matching","author":"N. V\u00e4lim\u00e4ki","year":"2007","unstructured":"V\u00e4lim\u00e4ki, N., M\u00e4kinen, V.: Space-Efficient Algorithms for Document Retrieval. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol.\u00a04580, pp. 205\u2013215. Springer, Heidelberg (2007)"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear Pattern Matching Algorithms. In: Proc. Switching and Automata Theory, pp. 1\u201311 (1973)","DOI":"10.1109\/SWAT.1973.13"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","first-page":"182","volume-title":"SPIRE 2009","author":"S.B. Wu","year":"2009","unstructured":"Wu, S.B., Hon, W.K., Shah, R.: Efficient Index for Retrieving Top-k Most Frequent Documents. In: Karlgren, J., Tarhio, J., Hyyr\u00f6, H. (eds.) SPIRE 2009. LNCS, vol.\u00a05721, pp. 182\u2013193. Springer, Heidelberg (2009)"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-642-02882-3_11","volume-title":"Computing and Combinatorics","author":"C.C. Yu","year":"2009","unstructured":"Yu, C.C., Hon, W.K., Wang, B.F.: Efficient Data Structures for the Orthogonal Range Successor Problem. In: Ngo, H.Q. (ed.) COCOON 2009. LNCS, vol.\u00a05609, pp. 96\u2013105. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16321-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T03:13:14Z","timestamp":1559704394000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16321-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642163203","9783642163210"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16321-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}