{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:59Z","timestamp":1760202539310},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734192"},{"type":"electronic","value":"9783540734208"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73420-8_47","type":"book-chapter","created":{"date-parts":[[2007,8,25]],"date-time":"2007-08-25T14:58:43Z","timestamp":1188053923000},"page":"533-545","source":"Crossref","is-referenced-by-count":10,"title":["In-Place Suffix Sorting"],"prefix":"10.1007","author":[{"given":"Gianni","family":"Franceschini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Muthukrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"47_CR1","doi-asserted-by":"crossref","unstructured":"Farach, M.: Optimal Suffix Tree Construction with Large Alphabets. In: FOCS 1997, pp. 137\u2013143 (1997)","DOI":"10.1109\/SFCS.1997.646102"},{"key":"47_CR2","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Manzini, G.: Engineering a lightweight suffix array construction algorithm. In: Proc. ESA (2002)","DOI":"10.1007\/3-540-45749-6_61"},{"key":"47_CR3","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 Univ Press, Cambridge (1997)"},{"key":"47_CR4","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1007\/3-540-45061-0_73","volume":"2719","author":"J. K\u00e4rkk\u00e4inen","year":"2003","unstructured":"K\u00e4rkk\u00e4inen, J., Sanders, P.: Simple linear work suffix array construction. Int. Colloquium on Automata, Languages and Programming\u00a02719, 943\u2013955 (2003)","journal-title":"Int. Colloquium on Automata, Languages and Programming"},{"key":"47_CR5","doi-asserted-by":"crossref","unstructured":"K\u00e4rkk\u00e4inen, J., Sanders, P., Burkhardt, S.: Linear work suffix array construction. Journal of the ACM (in press)","DOI":"10.1145\/1217856.1217858"},{"key":"47_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-44888-8_15","volume-title":"Combinatorial Pattern Matching","author":"P. Ko","year":"2003","unstructured":"Ko, P., Aluru, S.: Space efficient linear time construction of suffix arrays. In: Baeza-Yates, R.A., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 200\u2013210. Springer, Heidelberg (2003)"},{"issue":"1","key":"47_CR7","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/0022-0000(86)90043-7","volume":"33","author":"J. Ian","year":"1986","unstructured":"Ian Munro, J.: An implicit data structure supporting insertion, deletion, and search in O(log2 n) time. Journal of Computer and System Sciences\u00a033(1), 66\u201374 (1986)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"47_CR8","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/0196-6774(87)90050-2","volume":"8","author":"J. Salowe","year":"1987","unstructured":"Salowe, J., Steiger, W.: Simplified stable merging tasks. Journal of Algorithms\u00a08(4), 557\u2013571 (1987)","journal-title":"Journal of Algorithms"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73420-8_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:11:13Z","timestamp":1619518273000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73420-8_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734192","9783540734208"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73420-8_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}