{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:27:49Z","timestamp":1761611269788},"publisher-location":"Berlin, Heidelberg","reference-count":20,"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_19","type":"book-chapter","created":{"date-parts":[[2010,10,5]],"date-time":"2010-10-05T14:51:32Z","timestamp":1286290292000},"page":"191-200","source":"Crossref","is-referenced-by-count":15,"title":["Faster Compressed Dictionary Matching"],"prefix":"10.1007","author":[{"given":"Wing-Kai","family":"Hon","sequence":"first","affiliation":[]},{"given":"Tsung-Han","family":"Ku","sequence":"additional","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":[{"issue":"6","key":"19_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A. Aho","year":"1975","unstructured":"Aho, A., Corasick, M.: Efficient String Matching: An Aid to Bibliographic Search. Communications of the ACM\u00a018(6), 333\u2013340 (1975)","journal-title":"Communications of the ACM"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/3-540-56024-6_21","volume-title":"Combinatorial Pattern Matching","author":"A. Amir","year":"1992","unstructured":"Amir, A., Farach, M., Matias, Y.: Efficient Randomized Dictionary Matching Algorithms (Extended Abstract). In: Apostolico, A., Galil, Z., Manber, U., Crochemore, M. (eds.) CPM 1992. LNCS, vol.\u00a0644, pp. 262\u2013275. Springer, Heidelberg (1992)"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-642-13509-5_9","volume-title":"Combinatorial Pattern Matching","author":"D. Belazzougui","year":"2010","unstructured":"Belazzougui, D.: Succinct Dictionary Matching With No Slowdown. In: Amir, A., Parida, L. (eds.) Combinatorial Pattern Matching. LNCS, vol.\u00a06129, pp. 88\u2013100. Springer, Heidelberg (2010)"},{"key":"19_CR4","unstructured":"Burrows, M., Wheeler, D.J.: A Block-sorting Lossless Data Compression Algorithm. Technical Report 124, Digital Equipment Corporation, Paolo Alto, CA, USA (1994)"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Chan, H.L., Hon, W.K., Lam, T.W., Sadakane, K.: Compressed Indexes for Dynamic Text Collections. ACM Transactions on Algorithms\u00a03(2) (2007)","DOI":"10.1145\/1240233.1240244"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Luccio, F., Manzini, G., Muthukrishnan, S.: Structuring Labeled Trees for Optimal Succinctness, and Beyond. In: Proceedings of Symposium on Foundations of Computer Science, pp. 184\u2013196 (2005)","DOI":"10.1109\/SFCS.2005.69"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Luccio, F., Manzini, G., Muthukrishnan, S.: Compressing and Indexing Labeled Trees, With Applications. Journal of the ACM\u00a057(1) (2009)","DOI":"10.1145\/1613676.1613680"},{"key":"#cr-split#-19_CR8.1","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Manzini, G.: Indexing Compressed Text. Journal of the ACM??52(4), 552???581 (2005);","DOI":"10.1145\/1082036.1082039"},{"key":"#cr-split#-19_CR8.2","unstructured":"A preliminary version appears in FOCS 2000"},{"key":"19_CR9","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\u00a03(2) (2007)","DOI":"10.1145\/1240233.1240243"},{"key":"#cr-split#-19_CR10.1","doi-asserted-by":"crossref","unstructured":"Grossi, R., Vitter, J.S.: Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching. SIAM Journal on Computing??35(2), 378???407 (2005);","DOI":"10.1137\/S0097539702402354"},{"key":"#cr-split#-19_CR10.2","unstructured":"A preliminary version appears in STOC 2000"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/978-3-540-73420-8_46","volume-title":"Automata, Languages and Programming","author":"A. Gupta","year":"2007","unstructured":"Gupta, A., Hon, W.K., Shah, R., Vitter, J.S.: A Framework for Dynamizing Succinct Data Structures. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 521\u2013532. Springer, Heidelberg (2007)"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Hon, W.-K., Lam, T.-W., Shah, R., Tam, S.-L., Vitter, J.S.: Compressed Index for Dictionary Matching. In: Proceedings of Data Compression Conference, pp. 23\u201332 (2008)","DOI":"10.1109\/DCC.2008.62"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Jacobson, G.: Space-efficient Static Trees and Graphs. In: Proceedings of Symposium on Foundations of Computer Science, pp. 549\u2013554 (1989)","DOI":"10.1109\/SFCS.1989.63533"},{"issue":"2","key":"19_CR14","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E.M. McCreight","year":"1976","unstructured":"McCreight, E.M.: A Space-economical Suffix Tree Construction Algorithm. Journal of the ACM\u00a023(2), 262\u2013272 (1976)","journal-title":"Journal of the ACM"},{"key":"19_CR15","unstructured":"Raman, R., Raman, V., Rao, S.S.: Succinct Indexable Dictionaries with Applications to Encoding k-ary Trees and Multisets. In: Proceedings of Symposium on Discrete Algorithms, pp. 233\u2013242 (2002)"},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-642-03784-9_5","volume-title":"String Processing and Information Retrieval","author":"A. Tam","year":"2009","unstructured":"Tam, A., Wu, E., Lam, T.W., Yiu, S.M.: Succinct Text Indexing With Wildcards. In: Karlgren, J., Tarhio, J., Hyyr\u00f6, H. (eds.) String Processing and Information Retrieval. LNCS, vol.\u00a05721, pp. 39\u201350. Springer, Heidelberg (2009)"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear Pattern Matching Algorithms. In: Proceedings of Symposium on Switching and Automata Theory, pp. 1\u201311 (1973)","DOI":"10.1109\/SWAT.1973.13"},{"key":"19_CR18","volume-title":"Managing Gigabytes: Compressing and Indexing Documents and Images","author":"I. Witten","year":"1999","unstructured":"Witten, I., Moffat, A., Bell, T.: Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann Publishers, Los Altos (1999)"}],"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_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T07:13:33Z","timestamp":1559718813000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16321-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642163203","9783642163210"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16321-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}