{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:06:45Z","timestamp":1743098805367,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":16,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_422","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:37:39Z","timestamp":1214505459000},"page":"950-954","source":"Crossref","is-referenced-by-count":0,"title":["Text Indexing"],"prefix":"10.1007","author":[{"given":"Srinivas","family":"Aluru","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"422_CR1_422","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S1570-8667(03)00065-0","volume":"2","author":"M. Abouelhoda","year":"2004","unstructured":"Abouelhoda, M., Kurtz, S., Ohlebusch, E.: Replacing suffix trees with enhanced suffix arrays. J.\u00a0Discret. Algorithms 2, 53\u201386 (2004)","journal-title":"J. Discret. Algorithms"},{"key":"422_CR2_422","series-title":"Computer and Information Science Series","volume-title":"Handbook of Computational Molecular Biology","year":"2005","unstructured":"Aluru, S. (ed.): Handbook of Computational Molecular Biology. Computer and Information Science Series. Chapman and Hall\/CRC Press, Boca Raton (2005)"},{"key":"422_CR3_422","first-page":"67","volume-title":"Proceedings of the 12th International Symposium on String Processing and Information Retrieval, SPIRE 2005. LNCS, vol. 3772","author":"A. Amir","year":"2005","unstructured":"Amir, A., Kopelowitz, T., Lewenstein, M., Lewenstein, N.: Towards real-time suffix tree construction. In: Proc. String Processing and Information Retrieval Symposium (SPIRE), 2005, pp.\u00a067\u201378"},{"doi-asserted-by":"crossref","unstructured":"Ciriani, V., Ferragina, P., Luccio, F., Muthukrishnan, S.: A\u00a0data structure for a\u00a0sequence of string acesses in external memory. ACM Trans. Algorithms 3 (2007)","key":"422_CR4_422","DOI":"10.1145\/1186810.1186816"},{"key":"422_CR5_422","first-page":"81","volume-title":"International Workshop on Experimental and Efficient Algorithms (WEA). Lecture Notes in Computer Science, vol. 2","author":"P. Crescenzi","year":"2003","unstructured":"Crescenzi, P., Grossi, R., Italiano, G.: Search data structures for skewed strings. In: International Workshop on Experimental and Efficient Algorithms (WEA). Lecture Notes in Computer Science, vol.\u00a02, pp.\u00a081\u201396. Springer, Berlin (2003)"},{"key":"422_CR6_422","doi-asserted-by":"publisher","DOI":"10.1142\/9789812778222","volume-title":"Jewels of Stringology","author":"M. Crochemore","year":"2002","unstructured":"Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific Publishing Company, Singapore (2002)"},{"key":"422_CR7_422","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1137\/S0097539795286119","volume":"3","author":"P. Ferragina","year":"1998","unstructured":"Ferragina, P., Grossi, R.: Optimal On-Line Search and Sublinear Time Update in String Matching. SIAM J.\u00a0Comput. 3, 713\u2013736 (1998)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Franceschini, G., Grossi, R.: A\u00a0general technique for managing strings in comparison\u2010driven data structures. In: Annual International Colloquium on Automata, Languages and Programming (ICALP), 2004","key":"422_CR8_422","DOI":"10.1007\/978-3-540-27836-8_52"},{"key":"422_CR9_422","first-page":"372","volume-title":"Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP '99). LNCS, vol. 1644","author":"R. Grossi","year":"1999","unstructured":"Grossi, R., Italiano, G.: Efficient techniques for maintaining multidimensional keys in linked data structures. In: Annual International Colloquium on Automata, Languages and Programming (ICALP), 1999, pp.\u00a0372\u2013381"},{"key":"422_CR10_422","doi-asserted-by":"publisher","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, New York (1997)"},{"key":"422_CR11_422","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1145\/1217856.1217858","volume":"53","author":"J. Karkkainen","year":"2006","unstructured":"Karkkainen, J., Sanders, P., Burkhardt, S.: Linear work suffix arrays construction. J.\u00a0ACM 53, 918\u2013936 (2006)","journal-title":"J. ACM"},{"key":"422_CR12_422","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/3-540-48194-X_17","volume-title":"Proc. 12th Annual Symposium on Combinatorial Pattern Matching, vol. (2089) of LNCS","author":"T. Kasai","year":"2001","unstructured":"Kasai, T., Lee, G., Arimura, H. et al.: Linear-time longest\u2010common\u2010prefix computation in suffix arrays and its applications. In: Proc. 12th Annual Symposium, Combinatorial Pattern Matching (CPM), 2001, pp.\u00a0181\u2013192"},{"key":"422_CR13_422","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.\u00a0Discret. Algorithms 3, 143\u2013156 (2005)","journal-title":"J. Discret. Algorithms"},{"doi-asserted-by":"crossref","unstructured":"Ko, P., Aluru, S.: Optimal self\u2010adjustring tree for dynamic string data in secondary storage. In: Proc. String Processing and Information Retrieval Symposium (SPIRE). Lect. Notes Comp. Sci. vol. 4726, pp. 184\u2013194, Santiago, Chile (2007)","key":"422_CR14_422","DOI":"10.1007\/978-3-540-75530-2_17"},{"key":"422_CR15_422","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"Manber, U., Myers, G.: Suffix arrays: a\u00a0new method for on-line search. SIAM J.\u00a0Comput. 22, 935\u2013948 (1993)","journal-title":"SIAM J. Comput."},{"key":"422_CR16_422","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G. Navarro","year":"2001","unstructured":"Navarro, G.: A\u00a0guided tour to approximate string matching. ACM Comput. Surv. 33, 31\u201388 (2001)","journal-title":"ACM Comput. Surv."}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_422","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T01:55:49Z","timestamp":1662170149000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_422"}},"subtitle":["1993; Manber, Myers"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_422","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}