{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:55:49Z","timestamp":1725558949061},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540240143"},{"type":"electronic","value":"9783540305507"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30550-7_19","type":"book-chapter","created":{"date-parts":[[2010,7,2]],"date-time":"2010-07-02T19:06:05Z","timestamp":1278097565000},"page":"225-236","source":"Crossref","is-referenced-by-count":1,"title":["An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars"],"prefix":"10.1007","author":[{"given":"Shunsuke","family":"Inenaga","sequence":"first","affiliation":[]},{"given":"Ayumi","family":"Shinohara","sequence":"additional","affiliation":[]},{"given":"Masayuki","family":"Takeda","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1145\/136035.136043","volume":"24","author":"R.E. Bryant","year":"1992","unstructured":"Bryant, R.E.: Symbolic boolean manipulation with ordered binary decision diagrams. ACM Computing Surveys\u00a024, 293\u2013318 (1992)","journal-title":"ACM Computing Surveys"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Charikar, M., Lehman, E., Liu, D., Panigrahy, R., Prabhakaran, M., Rasala, A., Sahai, A., Shelat, A.: Approximating the smallest grammar: Kolmogorov complexity in natural models. In: Proc. STOC 2002, pp. 792\u2013801 (2002)","DOI":"10.1145\/509907.510021"},{"key":"19_CR3","volume-title":"Text Algorithms","author":"M. Crochemore","year":"1994","unstructured":"Crochemore, M., Rytter, W.: Text Algorithms. Oxford University Press, New York (1994)"},{"key":"19_CR4","doi-asserted-by":"publisher","DOI":"10.1142\/9789812778222","volume-title":"Jewels of Stringology","author":"M. Crochemore","year":"2002","unstructured":"Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific, Singapore (2002)"},{"key":"19_CR5","unstructured":"Gage, P.: A new algorithm for data compression. The C Users Journal\u00a012(2) (1994)"},{"key":"19_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, New York (1997)"},{"key":"19_CR7","unstructured":"Inenaga, S., Shinohara, A., Takeda, M.: A fully compressed pattern matching algorithm for simple collage systems. In: Proc. PSC 2004, pp. 98\u2013113. Czech Technical University (2004)"},{"issue":"2","key":"19_CR8","first-page":"172","volume":"4","author":"M. Karpinski","year":"1997","unstructured":"Karpinski, M., Rytter, W., Shinohara, A.: An efficient pattern-matching algorithm for strings with short descriptions. Nordic J. Comput.\u00a04(2), 172\u2013186 (1997)","journal-title":"Nordic J. Comput."},{"issue":"3","key":"19_CR9","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1109\/18.841160","volume":"46","author":"J. Kieffer","year":"2000","unstructured":"Kieffer, J., Yang, E.: Grammar-based codes: a new class of universal lossless source codes. IEEE Transactions on Information Theory\u00a046(3), 737\u2013754 (2000)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"19_CR10","doi-asserted-by":"crossref","first-page":"29","DOI":"10.4310\/CIS.2002.v2.n1.a2","volume":"2","author":"J. Kieffer","year":"2002","unstructured":"Kieffer, J., Yang, E.: Grammar-based codes for universal lossless data compression. Communications in Information and Systems\u00a02(2), 29\u201352 (2002)","journal-title":"Communications in Information and Systems"},{"issue":"4","key":"19_CR11","doi-asserted-by":"publisher","first-page":"1227","DOI":"10.1109\/18.850665","volume":"46","author":"J. Kieffer","year":"2000","unstructured":"Kieffer, J., Yang, E., Nelson, G., Cosman, P.: Universal lossless compression via multilevel pattern matching. IEEE Transactions on Information Theory\u00a046(4), 1227\u20131245 (2000)","journal-title":"IEEE Transactions on Information Theory"},{"key":"19_CR12","first-page":"296","volume-title":"Proc. DCC 1999","author":"J. Larsson","year":"1999","unstructured":"Larsson, J., Moffat, A.: Offline dictionary-based compression. In: Proc. DCC 1999, pp. 296\u2013305. IEEE Computer Society Press, Los Alamitos (1999)"},{"issue":"1","key":"19_CR13","first-page":"187","volume":"1","author":"M. Miyazaki","year":"2000","unstructured":"Miyazaki, M., Shinohara, A., Takeda, M.: An improved pattern matching algorithm for strings in terms of straight line programs. Journal of Discrete Algorithms\u00a01(1), 187\u2013204 (2000)","journal-title":"Journal of Discrete Algorithms"},{"issue":"2\/3","key":"19_CR14","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1093\/comjnl\/40.2_and_3.103","volume":"40","author":"C. Nevill-Manning","year":"1997","unstructured":"Nevill-Manning, C., Witten, I.: Compression and explanation using hierarchical grammars. Computer Journal\u00a040(2\/3), 103\u2013116 (1997)","journal-title":"Computer Journal"},{"key":"19_CR15","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1613\/jair.374","volume":"7","author":"C. Nevill-Manning","year":"1997","unstructured":"Nevill-Manning, C., Witten, I.: Identifying hierarchical structure in sequences: a linear-time algorithm. J. Artificial Intelligence Research\u00a07, 67\u201382 (1997)","journal-title":"J. Artificial Intelligence Research"},{"key":"19_CR16","first-page":"265","volume-title":"Proc. DCC 1997","author":"C. Nevill-Manning","year":"1997","unstructured":"Nevill-Manning, C., Witten, I.: Inferring lexical and grammatical structure from sequences. In: Proc. DCC 1997, pp. 265\u2013274. IEEE Computer Society Press, Los Alamitos (1997)"},{"key":"19_CR17","first-page":"179","volume-title":"Proc. DCC 1998","author":"C. Nevill-Manning","year":"1998","unstructured":"Nevill-Manning, C., Witten, I.: Phrase hierarchy inference and compression in bounded space. In: Proc. DCC 1998, pp. 179\u2013188. IEEE Computer Society Press, Los Alamitos (1998)"},{"key":"19_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/3-540-47849-3_3","volume-title":"SOFSEM 1999: Theory and Practice of Informatics","author":"W. Rytter","year":"1999","unstructured":"Rytter, W.: Algorithms on compressed strings and arrays. In: Bartosek, M., Tel, G., Pavelka, J. (eds.) SOFSEM 1999. LNCS, vol.\u00a01725, pp. 48\u201365. Springer, Heidelberg (1999)"},{"issue":"1\u20133","key":"19_CR19","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0304-3975(02)00777-6","volume":"302","author":"W. Rytter","year":"2003","unstructured":"Rytter, W.: Application of Lempel-Ziv factorization to the approximation of grammar-based compression. Theoretical Comput. Sci.\u00a0302(1\u20133), 211\u2013222 (2003)","journal-title":"Theoretical Comput. Sci."},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/978-3-540-45138-9_61","volume-title":"Mathematical Foundations of Computer Science 2003","author":"P. Woelfel","year":"2003","unstructured":"Woelfel, P.: Symbolic topological sorting with OBDDs. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 671\u2013680. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30550-7_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:29:27Z","timestamp":1620012567000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30550-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540240143","9783540305507"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30550-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}