{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:33:06Z","timestamp":1759638786839},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319075655"},{"type":"electronic","value":"9783319075662"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07566-2_13","type":"book-chapter","created":{"date-parts":[[2014,6,12]],"date-time":"2014-06-12T03:50:31Z","timestamp":1402545031000},"page":"120-129","source":"Crossref","is-referenced-by-count":4,"title":["An Improved Query Time for Succinct Dynamic Dictionary Matching"],"prefix":"10.1007","author":[{"given":"Guy","family":"Feigenblat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ely","family":"Porat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ariel","family":"Shiftan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"13_CR1","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/S0022-0000(05)80047-9","volume":"49","author":"A. Amir","year":"1994","unstructured":"Amir, A., Farach, M., Galil, Z., Giancarlo, R., Park, K.: Dynamic dictionary matching. J. Comput. Syst. Sci.\u00a049(2), 208\u2013222 (1994)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Sahinalp, S.C., Vishkin, U.: Efficient approximate and dynamic matching of patterns using a labeling paradigm. In: FOCS, pp. 320\u2013328. IEEE Computer Society (1996)","DOI":"10.1109\/SFCS.1996.548491"},{"issue":"6","key":"13_CR3","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A.V. Aho","year":"1975","unstructured":"Aho, A.V., Corasick, M.J.: Efficient string matching: an aid to bibliographic search. Commun. ACM\u00a018(6), 333\u2013340 (1975)","journal-title":"Commun. ACM"},{"key":"13_CR4","first-page":"392","volume-title":"Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1993","author":"A. Amir","year":"1993","unstructured":"Amir, A., Farach, M., Idury, R.M., La Poutr\u00e9, J.A., Sch\u00e4ffer, A.A.: Improved dynamic dictionary matching. In: Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1993, pp. 392\u2013401. Society for Industrial and Applied Mathematics, Philadelphia (1993)"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1145\/335305.335351","volume-title":"Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, STOC 2000","author":"R. Grossi","year":"2000","unstructured":"Grossi, R., Vitter, J.S.: Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract). In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, STOC 2000, pp. 397\u2013406. ACM, New York (2000)"},{"issue":"4","key":"13_CR6","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1145\/1082036.1082039","volume":"52","author":"P. Ferragina","year":"2005","unstructured":"Ferragina, P., Manzini, G.: Indexing compressed text. J. ACM\u00a052(4), 552\u2013581 (2005)","journal-title":"J. ACM"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.1007\/978-3-642-10631-6_104","volume-title":"Algorithms and Computation","author":"W.-K. Hon","year":"2009","unstructured":"Hon, W.-K., Lam, T.-W., Shah, R., Tam, S.-L., Vitter, J.S.: Succinct index for dynamic dictionary matching. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 1034\u20131043. Springer, Heidelberg (2009)"},{"key":"13_CR8","first-page":"13","volume-title":"Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005","author":"H.L. Chan","year":"2005","unstructured":"Chan, H.L., Hon, W.K., Lam, T.W., Sadakane, K.: Dynamic dictionary matching and compressed suffix trees. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, pp. 13\u201322. Society for Industrial and Applied Mathematics, Philadelphia (2005)"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1145\/800152.804905","volume-title":"Proceedings of the Fourth Annual ACM Symposium on Theory of Computing, STOC 1972","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M., Miller, R.E., Rosenberg, A.L.: Rapid identification of repeated patterns in strings, trees and arrays. In: Proceedings of the Fourth Annual ACM Symposium on Theory of Computing, STOC 1972, pp. 125\u2013136. ACM, New York (1972)"},{"issue":"2","key":"13_CR10","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. J. ACM\u00a023(2), 262\u2013272 (1976)","journal-title":"J. ACM"},{"key":"13_CR11","first-page":"23","volume-title":"Proceedings of the Data Compression Conference, DCC 2008","author":"W.K. Hon","year":"2008","unstructured":"Hon, W.K., Lam, T.W., Shah, R., Tam, S.L., Vitter, J.S.: Compressed index for dictionary matching. In: Proceedings of the Data Compression Conference, DCC 2008, pp. 23\u201332. IEEE Computer Society, Washington, DC (2008)"},{"key":"13_CR12","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.) CPM 2010. LNCS, vol.\u00a06129, pp. 88\u2013100. Springer, Heidelberg (2010)"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-642-16321-0_19","volume-title":"String Processing and Information Retrieval","author":"W.-K. Hon","year":"2010","unstructured":"Hon, W.-K., Ku, T.-H., Shah, R., Thankachan, S.V., Vitter, J.S.: Faster compressed dictionary matching. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol.\u00a06393, pp. 191\u2013200. Springer, Heidelberg (2010)"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/3-540-45995-2_21","volume-title":"LATIN 2002: Theoretical Informatics","author":"W. Rytter","year":"2002","unstructured":"Rytter, W.: On maximal suffices and constant-space linear-time versions of kmp algorithm. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol.\u00a02286, pp. 196\u2013208. Springer, Heidelberg (2002)"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1137\/1.9781611973075.13","volume-title":"Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010","author":"K. Sadakane","year":"2010","unstructured":"Sadakane, K., Navarro, G.: Fully-functional succinct trees. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, pp. 134\u2013149. Society for Industrial and Applied Mathematics, Philadelphia (2010)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07566-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T03:09:20Z","timestamp":1548904160000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07566-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319075655","9783319075662"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07566-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}