{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:01:45Z","timestamp":1725483705407},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441588"},{"type":"electronic","value":"9783540457350"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45735-6_4","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T13:12:38Z","timestamp":1178197958000},"page":"31-43","source":"Crossref","is-referenced-by-count":20,"title":["Optimal Exact String Matching Based on Suffix Arrays"],"prefix":"10.1007","author":[{"given":"Mohamed Ibrahim","family":"Abouelhoda","sequence":"first","affiliation":[]},{"given":"Enno","family":"Ohlebusch","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Kurtz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,18]]},"reference":[{"key":"4_CR1","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of the Second Workshop on Algorithms in Bioinformatics","author":"M. I. Abouelhoda","year":"2002","unstructured":"M. I. Abouelhoda, S. Kurtz, and E. Ohlebusch. The Enhanced Suffix Array and its Applications to Genome Analysis. In Proceedings of the Second Workshop on Algorithms in Bioinformatics. Springer Verlag, Lecture Notes in Computer Science, accepted for publication, 2002."},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"A. Apostolico. The Myriad Virtues of Subword Trees. In Combinatorial Algorithms on Words, Springer Verlag, pages 85\u201396, 1985.","DOI":"10.1007\/978-3-642-82456-2_6"},{"key":"4_CR3","unstructured":"J. Bentley and R. Sedgewick. Fast Algorithms for Sorting and Searching Strings. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pages 360\u2013369, 1997."},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"P. Ferragina and G. Manzini. Opportunistic data structures with applications. In IEEE Symposium on Foundations of Computer Science, pages 390\u2013398, 2000.","DOI":"10.1109\/SFCS.2000.892127"},{"key":"4_CR5","unstructured":"P. Ferragina and G. Manzini. An experimental study of an opportunistic index. In Symposium on Discrete Algorithms, pages 269\u2013278, 2001."},{"key":"4_CR6","first-page":"66","volume-title":"Information Retrieval: Algorithms and Data Structures","author":"G. Gonnet","year":"1992","unstructured":"G. Gonnet, R. Baeza-Yates, and T. Snider. New Indices for Text: PAT trees and PAT arrays. In W. Frakes and R.A. Baeza-Yates, editors, Information Retrieval: Algorithms and Data Structures, pages 66\u201382. Prentice-Hall, Englewood Cliffs, NJ, 1992."},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"R. Grossi and J. S. Vitter. Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching. In ACM Symposium on the Theory of Computing (STOC 2000), pages 397\u2013406. ACM Press, 2000.","DOI":"10.1145\/335305.335351"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"D. Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge University Press, 1997.","DOI":"10.1017\/CBO9780511574931"},{"key":"4_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/3-540-48194-X_17","volume-title":"Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching, July 2001","author":"T. Kasai","year":"2001","unstructured":"T. Kasai, G. Lee, H. Arimura, S. Arikawa, and K. Park. Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and its Applications. In Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching, July 2001, Lecture Notes in Computer Science 2089, Springer Verlag, pages 181\u2013192, 2001."},{"issue":"13","key":"4_CR10","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1002\/(SICI)1097-024X(199911)29:13<1149::AID-SPE274>3.0.CO;2-O","volume":"29","author":"S. Kurtz","year":"1999","unstructured":"S. Kurtz. Reducing the Space Requirement of Suffix Trees. Software-Practice and Experience, 29(13):1149\u20131171, 1999.","journal-title":"Software-Practice and Experience"},{"key":"4_CR11","unstructured":"N. J. Larsson and K. Sadakane. Faster Suffix Sorting. Technical Report LU-CSTR: 99-214, Dept. of Computer Science, Lund University, 1999."},{"issue":"5","key":"4_CR12","doi-asserted-by":"publisher","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 String Searches. SIAM Journal on Computing, 22(5):935\u2013948, 1993.","journal-title":"SIAM Journal on Computing"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"P. Weiner. Linear Pattern Matching Algorithms. In Proceedings of the 14th IEEE Annual Symposium on Switching and Automata Theory, pages 1\u201311, The University of Iowa, 1973.","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45735-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T07:28:37Z","timestamp":1550302117000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45735-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441588","9783540457350"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45735-6_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}