{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:00Z","timestamp":1725664140287},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540600442"},{"type":"electronic","value":"9783540494126"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60044-2_44","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:35:11Z","timestamp":1330277711000},"page":"205-214","source":"Crossref","is-referenced-by-count":23,"title":["Pattern-matching for strings with short descriptions"],"prefix":"10.1007","author":[{"given":"Marek","family":"Karpinski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Rytter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ayumi","family":"Shinohara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"15_CR1","volume-title":"Text Algorithms","author":"M. Crochemore","year":"1994","unstructured":"M. Crochemore and W. Rytter, Text Algorithms, Oxford University Press, New York (1994)."},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"M. Farach and M. Thorup, \u201cString-matching in Lempel-Ziv compressed strings\u201d, to appear in Proc. 27th ACM STOC (1995).","DOI":"10.1145\/225058.225288"},{"key":"15_CR3","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman (1979)."},{"key":"15_CR4","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"R.M. Karp, \u201cReducibility among combinatorial problems\u201d, in R.E. Miller and J.W. Thatcher (eds.), Complexity of Computer Computations, Plemum Press, New York, pp.85\u2013103 (1972)."},{"key":"15_CR5","unstructured":"D. Knuth, The Art of Computing, Vol. II: Seminumerical Algorithms. Second edition. Addison-Wesley (1981)."},{"key":"15_CR6","unstructured":"M. Lothaire, Combinatorics on Words. Addison-Wesley (1993)."},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"W. Plandowski, \u201cTesting equivalence of morphisms on context-free languages\u201d, ESA'94, Lecture Notes in Computer Science 855, Springer-Verlag, 460\u2013470 (1994).","DOI":"10.1007\/BFb0049431"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60044-2_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:30:14Z","timestamp":1619573414000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60044-2_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540600442","9783540494126"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-60044-2_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}