{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:39:45Z","timestamp":1787337585322,"version":"build-2736575974"},"reference-count":32,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[2009,1]]},"abstract":"<jats:p>Suffix trees and suffix arrays are the most prominent full-text indices, and their construction algorithms are well studied. In the literature, the fastest algorithm runs in $O(n)$ time, while it requires $O(n\\log n)$-bit working space, where n denotes the length of the text. On the other hand, the most space-efficient algorithm requires $O(n)$-bit working space while it runs in $O(n\\log n)$ time. It was open whether these indices can be constructed in both $o(n\\log n)$ time and $o(n\\log n)$-bit working space. This paper breaks the above time-and-space barrier under the unit-cost word RAM. We give an algorithm for constructing the suffix array, which takes $O(n)$ time and $O(n)$-bit working space, for texts with constant-size alphabets. Note that both the time and the space bounds are optimal. For constructing the suffix tree, our algorithm requires $O(n\\log^{\\epsilon}n)$ time and $O(n)$-bit working space for any $0&lt;\\epsilon&lt;1$. Apart from that, our algorithm can also be adopted to build other existing full-text indices, such as compressed suffix tree, compressed suffix arrays, and FM-index. We also study the general case where the size of the alphabet $\\Sigma$ is not constant. Our algorithm can construct a suffix array and a suffix tree using optimal $O(n\\log|\\Sigma|)$-bit working space while running in $O(n\\log\\log|\\Sigma|)$ time and $O(n(\\log^{\\epsilon}n+\\log|\\Sigma|))$ time, respectively. These are the first algorithms that achieve $o(n\\log n)$ time with optimal working space. Moreover, for the special case where $\\log|\\Sigma|=O((\\log\\log n)^{1-\\epsilon})$, we can speed up our suffix array construction algorithm to the optimal $O(n)$.<\/jats:p>","DOI":"10.1137\/070685373","type":"journal-article","created":{"date-parts":[[2009,2,11]],"date-time":"2009-02-11T23:03:22Z","timestamp":1234393402000},"page":"2162-2178","source":"Crossref","is-referenced-by-count":53,"title":["Breaking a Time-and-Space Barrier in Constructing Full-Text Indices"],"prefix":"10.1137","volume":"38","author":[{"given":"Wing-Kai","family":"Hon","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kunihiko","family":"Sadakane","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wing-Kin","family":"Sung","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2009,2,11]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2002.1822"},{"key":"R2","unstructured":"M. Burrows and D. J. Wheeler,\n                      A Block-Sorting Lossless Data Compression Algorithm\n                      , Technical report 124, Digital Equipment Corporation, Palo Alto, CA, 1994."},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0051-5"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"M. Farach,\n                      Optimal suffix tree construction with large alphabets\n                      , in Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science (FOCS), Miami Beach, FL, 1997, pp. 137\u2013143.","DOI":"10.1109\/SFCS.1997.646102"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1145\/1082036.1082039"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702402354"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"D. A. Grossman and O. Frieder,\n                      Information Retrieval: Algorithms and Heuristics\n                      , Kluwer Academic Publishers, Boston, MA, 1998.","DOI":"10.1007\/978-1-4615-5539-1"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"D. Gusfield,\n                      Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology\n                      , Cambridge University Press, Cambridge, UK, 1997.","DOI":"10.1017\/CBO9780511574931"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"T. Hagerup,\n                      Sorting and searching on the word RAM\n                      , in Proceedings of the Symposium on Theoretical Aspects of Computer Science (STACS), Springer, Berlin, 1998, pp. 366\u2013398.","DOI":"10.1007\/BFb0028575"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2001.1171"},{"key":"R11","unstructured":"W. K. Hon,\n                      On the Construction and Application of Compressed Text Indexes\n                      , Ph.D. Thesis, University of Hong Kong, Hong Kong, 2004."},{"key":"R12","doi-asserted-by":"crossref","unstructured":"W. K. Hon and K. Sadakane,\n                      Space-economical algorithms for finding maximal unique matches\n                      , in Proceedings of the Annual Symposium on Combinatorial Pattern Matching (CPM), Springer, Berlin, 2002, pp. 144\u2013152.","DOI":"10.1007\/3-540-45452-7_13"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"G. Jacobson,\n                      Space-efficient static trees and graphs\n                      , in Proceedings of the ACM Symposium on Foundations of Computer Science (STOC), 1989, pp. 549\u2013554.","DOI":"10.1109\/SFCS.1989.63533"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1145\/1217856.1217858"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2004.08.019"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2004.08.002"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-024X(199911)29:13<1149::AID-SPE274>3.0.CO;2-O"},{"key":"R18","doi-asserted-by":"crossref","unstructured":"T. W. Lam, K. Sadakane, W. K. Sung, and S. M. Yiu,\n                      A space and time efficient algorithm for constructing compressed suffix arrays\n                      , in Proceedings of the International Conference on Computing and Combinatorics, Springer, Berlin, 2002, pp. 401\u2013410.","DOI":"10.1007\/3-540-45655-4_43"},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1137\/0222058"},{"key":"R20","doi-asserted-by":"publisher","DOI":"10.1145\/321941.321946"},{"key":"R21","doi-asserted-by":"crossref","unstructured":"K. Mehlhorn,\n                      Data Structures and Algorithms\n                      1:\n                      Sorting and Searching\n                      , Springer-Verlag, Heidelberg, Germany, 1984.","DOI":"10.1007\/978-3-642-69672-5_2"},{"key":"R22","doi-asserted-by":"crossref","unstructured":"J. I. Munro,\n                      Tables\n                      , in Proceedings of the Conference on Foundations of Software Technology and Theoretical Computer Science, Springer, Berlin, 1996, pp. 37\u201342.","DOI":"10.1007\/3-540-62034-6_35"},{"key":"R23","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.05.030"},{"key":"R24","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700369909"},{"key":"R25","unstructured":"R. Raman, V. Raman, and S. S. Rao,\n                      \n                        Succinct indexable dictionaries with applications to encoding\n                        k\n                        -ary trees and multisets\n                      \n                      , in Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), ACM, New York, SIAM, Philadelphia, 2002, pp. 233\u2013242."},{"key":"R26","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00087-7"},{"key":"R27","unstructured":"J. Seward,\n                      The\n                      bzip2\n                      and\n                      libbzip2\n                      Official Home Page\n                      , http:\/\/www.bzip.org\/ (2008)."},{"key":"R28","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037568"},{"key":"R29","doi-asserted-by":"publisher","DOI":"10.1007\/BF01206331"},{"key":"R30","doi-asserted-by":"crossref","unstructured":"P. Weiner,\n                      Linear pattern matching algorithms\n                      , in Proceedings of the 14th Annual IEEE Symposium on Switching and Automata Theory, Iowa City, IA, 1973, pp. 1\u201311.","DOI":"10.1109\/SWAT.1973.13"},{"key":"R31","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(83)90075-3"},{"key":"R32","doi-asserted-by":"publisher","DOI":"10.1145\/234889.234891"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/070685373","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:18:59Z","timestamp":1787336339000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/070685373"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1]]},"references-count":32,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2009,1]]}},"alternative-id":["10.1137\/070685373"],"URL":"https:\/\/doi.org\/10.1137\/070685373","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1]]}}}