{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:17:28Z","timestamp":1725484648463},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540434009"},{"type":"electronic","value":"9783540459958"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45995-2_21","type":"book-chapter","created":{"date-parts":[[2007,5,29]],"date-time":"2007-05-29T22:33:34Z","timestamp":1180478014000},"page":"196-208","source":"Crossref","is-referenced-by-count":3,"title":["On Maximal Suffices and Constant-Space Linear-Time Versions of KMP Algorithm"],"prefix":"10.1007","author":[{"given":"Wojciech","family":"Rytter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"D. Breslauer, Saving Comparisons in the Crochemore-Perrin String Matching Algorithm. In Proc. of 1st European Symp. on Algorithms, p. 61\u201372, 1993.","DOI":"10.1007\/3-540-57273-2_44"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0304-3975(92)90134-2","volume":"92","author":"M. Crochemore","year":"1992","unstructured":"M. Crochemore, String-matching on ordered alphabets. Theoret. Comput. Sci., 92, p. 33\u201347, 1992.","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"21_CR3","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1145\/116825.116845","volume":"38","author":"M. Crochemore","year":"1991","unstructured":"M. Crochemore and D. Perrin, Two-way string-matching. J. Assoc. Comput. Mach., 38(3), p. 651\u2013675, 1991.","journal-title":"J. Assoc. Comput. Mach."},{"issue":"5","key":"21_CR4","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/BF01190846","volume":"13","author":"M. Crochemore","year":"1995","unstructured":"M. Crochemore and W. Rytter, Cubes, squares and time space efficient string matching, Algorithmica 13,5 (1995) 405\u2013425","journal-title":"Algorithmica"},{"key":"21_CR5","volume-title":"Text algorithms","author":"M. Crochemore","year":"1994","unstructured":"M. Crochemore and W. Rytter, Text algorithms, Oxford University Press, New York, 1994"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1016\/0022-0000(83)90002-8","volume":"26","author":"Z. Galil","year":"1983","unstructured":"Z. Galil and J. Seiferas, Time-space-optimal string matching. J. Comput. System Sci., 26, p. 280\u2013294, 1983.","journal-title":"J. Comput. System Sci."},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"L. Gasieniec, W. Plandowski and W. Rytter, The zooming method: a recursive approach to time-space efficient string-matching. Theoretical Computer Science 1995","DOI":"10.1016\/0304-3975(94)00249-I"},{"key":"21_CR8","series-title":"Lect Notes Comput Sci","volume-title":"String matching in small time and space, Combinatorial Pattern Matching","author":"L. Gasieniec","year":"1995","unstructured":"L. Gasieniec, W. Plandowski and W. Rytter, String matching in small time and space, Combinatorial Pattern Matching 1995, Lecture Notes in Computer Science 1995"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/0196-6774(83)90017-2","volume":"4","author":"J.-P. Duval","year":"1983","unstructured":"J-P. Duval, Factorizing words over an ordered alphabet, J. Algorithms 4 (1983): 363\u2013381.","journal-title":"J. Algorithms"},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1137\/0206024","volume":"6","author":"D.E. Knuth","year":"1977","unstructured":"D.E. Knuth, J.H. Morris and V.R. Pratt, Fast pattern matching in strings. SIAM J. Comput., 6, p. 322\u2013350, 1977.","journal-title":"SIAM J. Comput."},{"key":"21_CR11","volume-title":"Combinatorics on Words","author":"M. Lothaire","year":"1983","unstructured":"M. Lothaire, Combinatorics on Words. Addison-Wesley, Reading, MA., U.S.A., 1983."}],"container-title":["Lecture Notes in Computer Science","LATIN 2002: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45995-2_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T19:14:42Z","timestamp":1550344482000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45995-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540434009","9783540459958"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45995-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]}}}