{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:31:39Z","timestamp":1757453499503,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540778905"},{"type":"electronic","value":"9783540778912"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-77891-2_5","type":"book-chapter","created":{"date-parts":[[2008,1,12]],"date-time":"2008-01-12T08:19:36Z","timestamp":1200125976000},"page":"46-57","source":"Crossref","is-referenced-by-count":13,"title":["Indexing Circular Patterns"],"prefix":"10.1007","author":[{"given":"Costas S.","family":"Iliopoulos","sequence":"first","affiliation":[]},{"given":"M. Sohel","family":"Rahman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-45735-6_4","volume-title":"String Processing and Information Retrieval","author":"M.I. Abouelhoda","year":"2002","unstructured":"Abouelhoda, M.I., Ohlebusch, E., Kurtz, S.: Optimal exact string matching based on suffix arrays. In: Laender, A.H.F., Oliveira, A.L. (eds.) SPIRE 2002. LNCS, vol.\u00a02476, pp. 31\u201343. Springer, Heidelberg (2002)"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Alstrup, S., Brodal, G.S., Rauhe, T.: New data structures for orthogonal range searching. In: FOCS, pp. 198\u2013207 (2000)","DOI":"10.1109\/SFCS.2000.892088"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"1221","DOI":"10.1145\/1109557.1109692","volume-title":"SODA","author":"A. Amir","year":"2006","unstructured":"Amir, A., Aumann, Y., Benson, G., Levy, A., Lipsky, O., Porat, E., Skiena, S., Vishne, U.: Pattern matching with address errors: rearrangement distances. In: SODA, pp. 1221\u20131229. ACM Press, New York (2006)"},{"issue":"2","key":"5_CR4","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1006\/jagm.2000.1120","volume":"37","author":"A. Amir","year":"2000","unstructured":"Amir, A., Aumann, Y., Landau, G.M., Lewenstein, M., Lewenstein, N.: Pattern matching with swaps. J. Algorithms\u00a037(2), 247\u2013266 (2000)","journal-title":"J. Algorithms"},{"issue":"1","key":"5_CR5","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/0890-5401(91)90016-U","volume":"95","author":"A. Apostolico","year":"1991","unstructured":"Apostolico, A., Crochemore, M.: Optimal canonization of all substrings of a string. Inf. Comput.\u00a095(1), 76\u201395 (1991)","journal-title":"Inf. Comput."},{"issue":"4\/5","key":"5_CR6","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/0020-0190(80)90149-0","volume":"10","author":"K.S. Booth","year":"1980","unstructured":"Booth, K.S.: Lexicographically least circular substrings. Inf. Process. Lett.\u00a010(4\/5), 240\u2013242 (1980)","journal-title":"Inf. Process. Lett."},{"key":"5_CR7","unstructured":"Crochemore, M., Hancart, C., Lecroq, T.: Algorithmique du texte. Vuibert Informatique (2001)"},{"key":"5_CR8","doi-asserted-by":"crossref","DOI":"10.1142\/4838","volume-title":"Jewels of Stringology","author":"M. Crochemore","year":"2002","unstructured":"Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific, Singapore (2002)"},{"issue":"4","key":"5_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":"Duval, J.-P.: Factorizing words over an ordered alphabet. J. Algorithms\u00a04(4), 363\u2013381 (1983)","journal-title":"J. Algorithms"},{"key":"5_CR10","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":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)"},{"key":"5_CR11","first-page":"251","volume-title":"FOCS","author":"W.-K. Hon","year":"2003","unstructured":"Hon, W.-K., Sadakane, K., Sung, W.-K.: Breaking a time-and-space barrier in constructing full-text indices. In: FOCS, pp. 251\u2013260. IEEE Computer Society Press, Los Alamitos (2003)"},{"issue":"1-3","key":"5_CR12","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/j.tcs.2005.11.022","volume":"352","author":"T.N.D. Huynh","year":"2006","unstructured":"Huynh, T.N.D., Hon, W.-K., Lam, T.W., Sung, W.-K.: Approximate string matching using compressed suffix arrays. Theor. Comput. Sci.\u00a0352(1-3), 240\u2013249 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"5_CR13","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1145\/1217856.1217858","volume":"53","author":"J. K\u00e4rkk\u00e4inen","year":"2006","unstructured":"K\u00e4rkk\u00e4inen, J., Sanders, P., Burkhardt, S.: Simple linear work suffix array construction. J. ACM\u00a053(6), 918\u2013936 (2006)","journal-title":"J. ACM"},{"issue":"2-4","key":"5_CR14","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.jda.2004.08.019","volume":"3","author":"D.K. Kim","year":"2005","unstructured":"Kim, D.K., Sim, J.S., Park, H., Park, K.: Constructing suffix arrays in linear time. J. Discrete Algorithms\u00a03(2-4), 126\u2013142 (2005)","journal-title":"J. Discrete Algorithms"},{"issue":"2","key":"5_CR15","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D.E. Knuth","year":"1977","unstructured":"Knuth, D.E., Morris Jr., J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput.\u00a06(2), 323\u2013350 (1977)","journal-title":"SIAM J. Comput."},{"issue":"2-4","key":"5_CR16","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.jda.2004.08.002","volume":"3","author":"P. Ko","year":"2005","unstructured":"Ko, P., Aluru, S.: Space efficient linear time construction of suffix arrays. J. Discrete Algorithms\u00a03(2-4), 143\u2013156 (2005)","journal-title":"J. Discrete Algorithms"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Lothaire, M. (ed.): Applied Combinatorics on Words. In: Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge (2005)","DOI":"10.1017\/CBO9781107341005"},{"issue":"5","key":"5_CR18","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"Manber, U., Myers, E.W.: Suffix arrays: A new method for on-line string searches. SIAM J. Comput.\u00a022(5), 935\u2013948 (1993)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"5_CR19","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E.M. McCreight","year":"1976","unstructured":"McCreight, E.M.: A space-economical suffix tree construction algorithm. J. ACM\u00a023(2), 262\u2013272 (1976)","journal-title":"J. ACM"},{"key":"5_CR20","first-page":"175","volume":"12","author":"K. Sadakane","year":"2001","unstructured":"Sadakane, K., Shibuya, T.: Indexing huge genome sequences for solving various problems. Genome Informatics\u00a012, 175\u2013183 (2001)","journal-title":"Genome Informatics"},{"issue":"2","key":"5_CR21","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0196-6774(81)90013-4","volume":"2","author":"Y. Shiloach","year":"1981","unstructured":"Shiloach, Y.: Fast canonization of circular strings. J. Algorithms\u00a02(2), 107\u2013121 (1981)","journal-title":"J. Algorithms"},{"issue":"3","key":"5_CR22","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E. Ukkonen","year":"1995","unstructured":"Ukkonen, E.: On-line construction of suffix trees. Algorithmica\u00a014(3), 249\u2013260 (1995)","journal-title":"Algorithmica"},{"key":"5_CR23","volume-title":"Basic Virology","author":"E.K. Wagner","year":"2003","unstructured":"Wagner, E.K., Hewlett, M.J.: Basic Virology, 2nd edn. Blackwell Publishing, Malden (2003)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77891-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,25]],"date-time":"2025-01-25T16:05:36Z","timestamp":1737821136000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77891-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540778905","9783540778912"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77891-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}