{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:30:31Z","timestamp":1725456631119},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540647393"},{"type":"electronic","value":"9783540690542"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0030787","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T07:49:24Z","timestamp":1133423364000},"page":"140-152","source":"Crossref","is-referenced-by-count":14,"title":["Simple and flexible detection of contiguous repeats using a suffix tree Preliminary Version"],"prefix":"10.1007","author":[{"given":"Jens","family":"Stoye","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Gusfield","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,20]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"A. Apostolico. The myriad virtues of subword trees. In A. Apostolico and Z. Galil, editors, Combinatorial Algorithms on Words, volume F12 of NATO ASI Series, pages 85\u201396. Springer Verlag, 1985.","DOI":"10.1007\/978-3-642-82456-2_6"},{"key":"11_CR2","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(83)90109-3","volume":"22","author":"A. Apostolico","year":"1983","unstructured":"A. Apostolico and F. P. Preparata. Optimal off-line detection of repetitions in a string. Theor. Comput. Sci., 22:297\u2013315, 1983.","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"11_CR3","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0020-0190(81)90024-7","volume":"12","author":"M. Crochemore","year":"1981","unstructured":"M. Crochemore. An optimal algorithm for computing the repetitions in a word. Inform. Process. Lett., 12(5):244\u2013250, 1981.","journal-title":"Inform. Process. Lett."},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"M. Crochemore and W. Rytter. Periodic prefixes in texts. In R. Capodelli, A. De Santis, and U. Vaccaro, editors, Sequences II, pages 153\u2013165. Springer Verlag, 1993.","DOI":"10.1007\/978-1-4613-9323-8_12"},{"key":"11_CR5","unstructured":"M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, 1994."},{"issue":"5","key":"11_CR6","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/BF01190846","volume":"13","author":"M. Crochemore","year":"1995","unstructured":"M. Crochemore and W. Rytter. Squares, cubes, and time-space efficient string searching. Algorithmica, 13(5):405\u2013425, 1995.","journal-title":"Algorithmica"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"M. Farach. Optimal suffix tree construction with large alphabets. In Proc. 38th Annu. Symp. Found. Comput. Sci., FOCS 97, 1997. IEEE Press.","DOI":"10.1109\/SFCS.1997.646102"},{"key":"11_CR8","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology","author":"D. Gusfield","year":"1997","unstructured":"D. Gusfield. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, New York, NY, 1997."},{"key":"11_CR9","unstructured":"R. W. Irving, Personal Communication."},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"S. R. Kosaraju. Computation of squares in a string. In M. Crochemore and D. Gusfield, editors, Combinatorial Pattern Matching: 5th Annual Symposium, CPM 94. Proceedings, number 807 in Lecture Notes in Computer Science, pages 146\u2013150, 1994. Springer Verlag.","DOI":"10.1007\/3-540-58094-8_13"},{"key":"11_CR11","unstructured":"G. M. Landau, Personal Communication."},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"G. M. Landau and J. P. Schmidt. An algorithm for approximate tandem repeats. In A. Apostolico, M. Crochemore, Z. Galil, and U. Manber, editors, Combinatorial Pattern. Matching: 4th Annual Symposium, CPM 93. Proceedings, number 684 in Lecture Notes in Computer Science, pages 120\u2013133, 1993. Springer Verlag.","DOI":"10.1007\/BFb0029801"},{"key":"11_CR13","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1016\/0196-6774(84)90021-X","volume":"5","author":"M. G. Main","year":"1984","unstructured":"M. G. Main and R. J. Lorentz. An O (n log n) algorithm for finding all repetitions in a string. J. Algor., 5:422\u2013432, 1984.","journal-title":"J. Algor."},{"key":"11_CR14","series-title":"NATO ASI Series","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/978-3-642-82456-2_18","volume-title":"Combinatorial Algorithms on Words","author":"M. G. Main","year":"1985","unstructured":"M. G. Main and R. J. Lorentz. Linear time recognition of squarefree strings. In A. Apostolico and Z. Galil, editors, Combinatorial Algorithms on Words, volume F12 of NATO ASI Series, pages 271\u2013278. Springer Verlag, Berlin, 1985."},{"key":"11_CR15","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"U. Manber and E. W. Myers. Suffix arrays: A new method for on-line search. SIAM J. Computing, 22:935\u2013948, 1993.","journal-title":"SIAM J. Computing"},{"issue":"2","key":"11_CR16","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E. M. McCreight","year":"1976","unstructured":"E. M. McCreight. A space-economical suffix tree construction algorithm. Journal of the ACM, 23(2):262\u2013272, 1976.","journal-title":"Journal of the ACM"},{"key":"11_CR17","unstructured":"J. P. Schmidt, Personal Communication."},{"key":"11_CR18","volume-title":"Applications of Combinatorial Analysis to Repetitions in Strings, Phylogeny, and Parallel Multiplier Design","author":"P. F. Stelling","year":"1995","unstructured":"P. F. Stelling. Applications of Combinatorial Analysis to Repetitions in Strings, Phylogeny, and Parallel Multiplier Design. Ph.d. dissertation, Department of Computer Science, University of California, Davis, 1995."},{"key":"11_CR19","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E. Ukkonen","year":"1995","unstructured":"E. Ukkonen. On-line construction of suffix trees. Algorithmica, 14:249\u2013260, 1995.","journal-title":"Algorithmica"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"P. Weiner. Linear pattern matching algorithms. In IEEE 14th Annual Symposium on Switching and Automata Theory, pages 1\u201311. IEEE Press, 1973.","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0030787","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,6]],"date-time":"2019-02-06T06:57:11Z","timestamp":1549436231000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0030787"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540647393","9783540690542"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0030787","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}