{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:54Z","timestamp":1760202534881},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540403111"},{"type":"electronic","value":"9783540448884"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44888-8_15","type":"book-chapter","created":{"date-parts":[[2007,3,5]],"date-time":"2007-03-05T11:34:12Z","timestamp":1173094452000},"page":"200-210","source":"Crossref","is-referenced-by-count":112,"title":["Space Efficient Linear Time Construction of Suffix Arrays"],"prefix":"10.1007","author":[{"given":"Pang","family":"Ko","sequence":"first","affiliation":[]},{"given":"Srinivas","family":"Aluru","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,5,27]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"M. I. Abouelhoda, S. Kurtz, and E. Ohlebusch. The enhanced suffix array and its applications to genome analysis. In 2nd Workshop on Algorithms in Bioinformatics, pages 449\u201363, 2002.","DOI":"10.1007\/3-540-45784-4_35"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"M. I. Abouelhoda, E. Ohlebusch, and S. Kurtz. Optimal exact string matching based on suffix arrays. In International Symposium on String Processing and Information Retrieval, pages 31\u201343. IEEE, 2002.","DOI":"10.1007\/3-540-45735-6_4"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"2369","DOI":"10.1093\/nar\/27.11.2369","volume":"27","author":"A. L. Delcher","year":"1999","unstructured":"A. L. Delcher, S. Kasif, R. D. Fleischmann, J. Peterson, O. White, and S. L. Salzberg. Alignment of whole genomes. Nucleic Acids Research, 27:2369\u201376, 1999.","journal-title":"Nucleic Acids Research"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"M. Farach and S. Muthukrishnan. Optimal logarithmic time randomized suffix tree construction. In Proc. of 23rd International Colloquium on Automata Languages and Programming, 1996.","DOI":"10.1007\/3-540-61440-0_158"},{"key":"15_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings Trees and Sequences","author":"D. Gusfield","year":"1997","unstructured":"D. Gusfield. Algorithms on Strings Trees and Sequences. Cambridge University Press, New York, New York, 1997."},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"H. Itoh and H. Tanaka. An efficient method for in memory construction of suffix array. In International Symposium on String Processing and Information Retrieval, pages 81\u201388. IEEE, 1999.","DOI":"10.1109\/SPIRE.1999.796581"},{"key":"15_CR7","doi-asserted-by":"crossref","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 12th Annual Symposium, Combinatorial Pattern Matching, pages 181\u201392, 2001.","DOI":"10.1007\/3-540-48194-X_17"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"J. K\u00e4rkk\u00e4nen and P. Sanders. Simpler linear work suffix array construction. In International Colloquium on Automata, Languages and Programming, page to appear, 2003.","DOI":"10.1007\/3-540-45061-0_73"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"D. K. Kim, J. S. Sim, H. Park, and K. Park. Linear-time construction of suffix arrays. In 14th Annual Symposium, Combinatorial Pattern Matching, 2003.","DOI":"10.1007\/3-540-44888-8_14"},{"key":"15_CR10","series-title":"Technical Report","volume-title":"Faster suffix sorting","author":"N. J. Larsson","year":"1999","unstructured":"N. J. Larsson and K. Sadakane. Faster suffix sorting. Technical Report LU-CS-TR:99-214, LUNDFD6\/(NFCS-3140)\/1-20\/(1999), Department of Computer Science, Lund University, Sweden, May 1999."},{"key":"15_CR11","doi-asserted-by":"publisher","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:262\u201372, 1976.","journal-title":"Journal of the ACM"},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"U. Manber and G. Myers. Suffix arrays: a new method for on-line search. SIAM Journal on Computing, 22:935\u201348, 1993.","journal-title":"SIAM Journal on Computing"},{"key":"15_CR13","doi-asserted-by":"publisher","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\u201360, 1995.","journal-title":"Algorithmica"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"P. Weiner. Linear pattern matching algorithms. In 14th Symposium on Switching and Automata Theory, pages 1\u201311. IEEE, 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\/3-540-44888-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T01:40:55Z","timestamp":1556156455000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44888-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540403111","9783540448884"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-44888-8_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}