{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:11:34Z","timestamp":1725484294413},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540439967"},{"type":"electronic","value":"9783540456551"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45655-4_43","type":"book-chapter","created":{"date-parts":[[2007,5,21]],"date-time":"2007-05-21T07:37:01Z","timestamp":1179733021000},"page":"401-410","source":"Crossref","is-referenced-by-count":14,"title":["A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays"],"prefix":"10.1007","author":[{"given":"Tak-Wah","family":"Lam","sequence":"first","affiliation":[]},{"given":"Kunihiko","family":"Sadakane","sequence":"additional","affiliation":[]},{"given":"Wing-Kin","family":"Sung","sequence":"additional","affiliation":[]},{"given":"Siu-Ming","family":"Yiu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,8,29]]},"reference":[{"key":"43_CR1","unstructured":"D. R. Clark and J. I. Munro. Efficient suffix trees on secondary storage. In Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 383\u2013391. 1996."},{"key":"43_CR2","doi-asserted-by":"crossref","unstructured":"Altschul S. F., Gish W., Miller W., Myers E. W., and Lipman D. J. Basic locol alignment search tool. Journal of Molecular Biology, pages 403\u2013410, 1990.","DOI":"10.1016\/S0022-2836(05)80360-2"},{"issue":"2","key":"43_CR3","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1109\/TIT.1975.1055349","volume":"21","author":"P. Elias","year":"1975","unstructured":"P. Elias. Universal codeword sets and representation of the integers. IEEE Transactions on Information Theory, 21(2):194\u2013203, 1975.","journal-title":"IEEE Transactions on Information Theory"},{"key":"43_CR4","doi-asserted-by":"crossref","unstructured":"P. Ferragine and G. Manzini. Opportunistic data structures with applications. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science (FOCS), pages 390\u2013398. 2000.","DOI":"10.1109\/SFCS.2000.892127"},{"key":"43_CR5","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 Proceedings of the 32nd ACM Symposium on Theory of Computing, pages 397\u2013406, 2000.","DOI":"10.1145\/335305.335351"},{"key":"43_CR6","unstructured":"E. Hunt, M. P. Atkinson, and R. W. Irving. A database index to large biological sequences. In Proceedings of the 27th VLDB Conference, pages 410\u2013421. 2000."},{"key":"43_CR7","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 Experiences, 29:1149\u20131171, 1999.","journal-title":"Software Practice and Experiences"},{"issue":"5","key":"43_CR8","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 string searches. SIAM Journal on Computing, 22(5):935\u2013948, 1993.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"43_CR9","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E. M. MCreight","year":"1976","unstructured":"E. M. MCreight. A space-economical suffix tree construction algorithm. Journal of the ACM, 23(2):262\u2013272, 1976.","journal-title":"Journal of the ACM"},{"key":"43_CR10","doi-asserted-by":"crossref","unstructured":"K. Sadakane. Compressed text databases with efficient query algorithms based on compressed suffix array. In Proceedings of the 11th International Conference on Algorithms and Computation (ISAAC), pages 410\u2013421. 2000.","DOI":"10.1007\/3-540-40996-3_35"},{"key":"43_CR11","unstructured":"K. Sadakane and T. Shibyya. Indexing huge genome sequences for solving various porblems. In Genome Informatics, pages 175\u2013183. 2001."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45655-4_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T15:57:49Z","timestamp":1550332669000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45655-4_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439967","9783540456551"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45655-4_43","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}