{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:32:49Z","timestamp":1725456769492},"publisher-location":"Berlin\/Heidelberg","reference-count":10,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540529535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0029611","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T05:33:46Z","timestamp":1133415226000},"page":"217-223","source":"Crossref","is-referenced-by-count":1,"title":["Parallel construction of minimal suffix and factor automata"],"prefix":"10.1007","author":[{"given":"Maxime","family":"Crochemore","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Rytter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"20_CR1","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF01762122","volume":"3","author":"A. Apostolico","year":"1988","unstructured":"A. Apostolico,C. Iliopoulos, G. Landau,B. Schieber, U. Vishkin, Parallel construction of a suffix tree with applications, Algorithmica 3,3 (1988) 347\u2013365","journal-title":"Algorithmica"},{"key":"20_CR2","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0304-3975(85)90157-4","volume":"40","author":"A. Blumer","year":"1985","unstructured":"A. Blumer, J. Blumer,D. Haussler,A. Echrefeucht, M. Chen,J. Seiferas, The smallest automaton recognizing subwords of the text, Th. Comp.Sco.40 (1985) 31\u201355","journal-title":"Th. Comp.Sco."},{"key":"20_CR3","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1145\/28869.28873","volume":"34","author":"A. Blumer","year":"1987","unstructured":"A. Blumer,J. Blumer,D. Haussler,R. McConnel, A. Ehrenfeucht, Coplete inverted files for efficient text retrieval and analysis, JACM 34 (1987) 578\u2013595","journal-title":"JACM"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"B. Chlebus,K. Diks,T. Radzik, Testing isomorphism of outerplanar graphs, MFCS'88, LNCS 324, 220\u2013230","DOI":"10.1007\/BFb0017145"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"M.Chen,J.Seiferas, Efficient and elegant subword tree construction, in Combinatorial Algorithms on Words (ed.A.Apostolico,Z.Galil)","DOI":"10.1007\/978-3-642-82456-2_7"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"M.Crochemore, Transducers and repetitions, TCS 45 (1986)","DOI":"10.1016\/0304-3975(86)90041-1"},{"key":"20_CR7","unstructured":"M.Crochemore, W.Rytter, Parallel computations on strings and arrays, STACS' 90"},{"key":"20_CR8","unstructured":"A.Gibbons,W.Rytter, Efficient parallel algorithms, Cambridge University Press (1988)"},{"key":"20_CR9","first-page":"125","volume":"4","author":"R. Karp","year":"1972","unstructured":"R. Karp, R. Miller, A. Rosenberg, Rapid identification of repeated patterns in strings, arrays and trees, STOC 4 (1972) 125\u2013136","journal-title":"STOC"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"W.Rytter, On the parallel transformations of regular expressions to nondeterministic finite automata, IPL 31, 103\u2013109","DOI":"10.1016\/0020-0190(89)90076-8"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1990"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0029611","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T08:15:45Z","timestamp":1586592945000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029611"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540529535"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0029611","relation":{},"subject":[]}}