{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:43Z","timestamp":1725663403668},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540176602"},{"type":"electronic","value":"9783540477464"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-17660-8_45","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:17:19Z","timestamp":1330197439000},"page":"26-36","source":"Crossref","is-referenced-by-count":8,"title":["Longest common factor of two words"],"prefix":"10.1007","author":[{"given":"Maxime","family":"Crochemore","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"J. BERSTEL, Transductions and context-free languages, Teubner, 1979.","DOI":"10.1007\/978-3-663-09367-1"},{"issue":"1","key":"3_CR2","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0304-3975(85)90157-4","volume":"40","author":"A. Blumer","year":"1985","unstructured":"A. BLUMER, J. EHRENFEUCHT, D. HAUSSLER, M.T. CHEN & J. SEIFEIRAS, The smallest automaton recognizing the subwords of a text, Theor. Comput. Sci. 40, 1 (1985) 31\u201356.","journal-title":"Theor. Comput. Sci."},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"C. CHOFFRUT, On some combinatorial properties of metrics over the free monoid, in: [Combinatorics on words, Cumming ed., Academic Press, 1983].","DOI":"10.1016\/B978-0-12-198820-3.50018-8"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"M. CROCHEMORE, Transducers and repetitions, Theor. Comput. Sci. (1986) to appear.","DOI":"10.1016\/0304-3975(86)90041-1"},{"issue":"2","key":"3_CR5","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D.E. Knuth","year":"1977","unstructured":"D.E. KNUTH, J.H. MORRIS & V.R. PRATT, Fast pattern-matching in strings, SIAM J. Compt. 6, 2 (1977) 323\u2013350.","journal-title":"SIAM J. Compt."},{"issue":"3","key":"3_CR6","doi-asserted-by":"publisher","first-page":"1316","DOI":"10.1007\/BF01084395","volume":"22","author":"A.O. Slisenko","year":"1983","unstructured":"A.O. SLISENKO, Detection of periodicities and string-matching in real time, J. of Soviet Mathematics 22, 3 (1983) 1316\u20131387.","journal-title":"J. of Soviet Mathematics"}],"container-title":["Lecture Notes in Computer Science","TAPSOFT '87"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-17660-8_45.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:11:45Z","timestamp":1619557905000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-17660-8_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540176602","9783540477464"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-17660-8_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}