{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:41:42Z","timestamp":1777596102175,"version":"3.51.4"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[1988,11,1]],"date-time":"1988-11-01T00:00:00Z","timestamp":594345600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1988,11]]},"DOI":"10.1007\/bf01762122","type":"journal-article","created":{"date-parts":[[2005,6,16]],"date-time":"2005-06-16T10:22:38Z","timestamp":1118917358000},"page":"347-365","source":"Crossref","is-referenced-by-count":129,"title":["Parallel construction of a suffix tree with applications"],"prefix":"10.1007","volume":"3","author":[{"given":"A.","family":"Apostolico","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Iliopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G. M.","family":"Landau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Schieber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"U.","family":"Vishkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01762122_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1974","unstructured":"A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974."},{"key":"BF01762122_CR2","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1051\/ita\/1984180201471","volume":"18","author":"A. Apostolico","year":"1984","unstructured":"A. Apostolico, On context-constrained squares and repetitions in a string,RAIRO Theoretical Informatics,18 (1984), 147\u2013159.","journal-title":"RAIRO Theoretical Informatics"},{"key":"BF01762122_CR3","series-title":"NATO ASI Series, Series F: Computer and System Sciences, Vol. 12","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-3-642-82456-2_6","volume-title":"Combinatorial Algorithms on Words","author":"A. Apostolico","year":"1985","unstructured":"A. Apostolico, The myriad virtues of subword trees, in A. Apostolico and Z. Galil (editors),Combinatorial Algorithms on Words, NATO ASI Series, Series F: Computer and System Sciences, Vol. 12, Springer-Verlag, Berlin, 1985, pp. 85\u201396."},{"key":"BF01762122_CR4","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1137\/0215007","volume":"15","author":"A. Apostolico","year":"1986","unstructured":"A. Apostolico and R. Giancarlo, The Boyer-Moore-Galil string searching strategies revisited,SIAM Journal on Computing,15 (1986), 98\u2013105.","journal-title":"SIAM Journal on Computing"},{"key":"BF01762122_CR5","unstructured":"A. Apostolico and C. Iliopoulos, Parallel log-time construction of suffix trees, CSD TR 632, Department of Computer Science, Purdue University, Sept. 1986."},{"key":"BF01762122_CR6","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(83)90109-3","volume":"22","author":"A. Apostolico","year":"1983","unstructured":"A. Apostolico and F. P. Preparata, Optimal off-line detection of repetitions in a string,Theoretical Computer Science,22 (1983), 297\u2013315.","journal-title":"Theoretical Computer Science"},{"key":"BF01762122_CR7","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/0022-0000(85)90060-1","volume":"31","author":"A. Apostolico","year":"1985","unstructured":"A. Apostolico and F. P. Preparata, Structural properties of the string statistics problem,Journal of Computer and System Sciences,31 (1985), 394\u2013411.","journal-title":"Journal of Computer and System Sciences"},{"key":"BF01762122_CR8","unstructured":"A. Apostolico and F. P. Preparata, Data structures and algorithms for the string statistics problem, CSD TR 541, Department of Computer Science, Purdue University, Sept. 1985."},{"key":"BF01762122_CR9","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(85)90008-X","volume":"30","author":"A. Borodin","year":"1985","unstructured":"A. Borodin and J. E. Hopcroft, Routing, merging and sorting on parallel models of computation,Journal of Computer and System Science,30 (1985), 130\u2013145.","journal-title":"Journal of Computer and System Science"},{"key":"BF01762122_CR10","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/S0019-9958(86)80023-7","volume":"70","author":"R. Cole","year":"1986","unstructured":"R. Cole and U. Vishkin, Deterministic coin tossing with applications to optimal parallel list ranking,Information and Control,70 (1986), 32\u201353.","journal-title":"Information and Control"},{"key":"BF01762122_CR11","doi-asserted-by":"crossref","unstructured":"R. Cole and U. Vishkin, Approximate and exact parallel scheduling with applications to list, tree, and graph problems,Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986, pp. 478\u2013491.","DOI":"10.1109\/SFCS.1986.10"},{"key":"BF01762122_CR12","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322226","volume":"27","author":"M. Fisher","year":"1980","unstructured":"M. Fisher and L. Ladner, Parallel prefix computation,Journal of the Association for Computing Machinery,27 (1980), 831\u2013838.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"BF01762122_CR13","series-title":"NATO ASI Series, Series F: Computer and System Sciences, Vol. 12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-642-82456-2_1","volume-title":"Combinatorial Algorithms on Words","author":"Z. Galil","year":"1985","unstructured":"Z. Galil, Open problems in stringology, in A. Apostolico and Z. Galil (editors),Combinatorial Algorithms on Words, NATO ASI Series, Series F: Computer and System Sciences, Vol. 12, Springer-Veriag, Berlin, 1985, pp. 1\u201310."},{"key":"BF01762122_CR14","doi-asserted-by":"crossref","unstructured":"R. M. Karp, R. E. Miller, and A. L. Rosenberg, Rapid identification of repeated patterns in strings, trees, and arrays,Proceedings of the 4th ACM Symposium on Theory of Computing, 1972, pp. 125\u2013136.","DOI":"10.1145\/800152.804905"},{"key":"BF01762122_CR15","doi-asserted-by":"crossref","first-page":"942","DOI":"10.1109\/TC.1983.1676138","volume":"32","author":"C. P. Kruskal","year":"1983","unstructured":"C. P. Kruskal, Searching, merging, and sorting in parallel computation,IEEE Transactions on Computers,32 (1983), 942\u2013946.","journal-title":"IEEE Transactions on Computers"},{"key":"BF01762122_CR16","first-page":"314","volume-title":"Lecture Notes in Computer Science, Vol. 267","author":"G. M. Landau","year":"1987","unstructured":"G. M. Landau, B. Schieber, and U. Vishkin, Parallel construction of a suffix tree, TR-53\/86, Department of Computer Science, Tel Aviv University, 1986, and alsoProceedings of the 14th ICALP, Lecture Notes in Computer Science, Vol. 267, Springer-Verlag, Berlin, 1987, pp. 314\u2013325."},{"key":"BF01762122_CR17","doi-asserted-by":"crossref","unstructured":"G. M. Landau and U. Vishkin, Introducing efficient parallelism into approximate string matching,Proceedings of the 18th ACM Symposium on Theory of Computing, 1986, pp. 220\u2013230.","DOI":"10.1145\/12130.12152"},{"key":"BF01762122_CR18","doi-asserted-by":"crossref","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 Association for Computing Machinery,23 (1976), 262\u2013272.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"BF01762122_CR19","unstructured":"B. Schieber and U. Vishkin, Parallel computation of lowest common ancestor in trees, TR-63\/87, Department of Computer Science, Tel Aviv University, 1987."},{"key":"BF01762122_CR20","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0196-6774(81)90010-9","volume":"2","author":"Y. Shiloach","year":"1981","unstructured":"Y. Shiloach and U. Vishkin, Finding the maximum, merging, and sorting in a parallel model of computation,Journal of Algorithms,2 (1981), 88\u2013102.","journal-title":"Journal of Algorithms"},{"key":"BF01762122_CR21","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1137\/0204030","volume":"4","author":"L. G. Valiant","year":"1975","unstructured":"L. G. Valiant, Parallelism in comparison problems,SIAM Journal on Computing,4 (1975), 348\u2013355.","journal-title":"SIAM Journal on Computing"},{"key":"BF01762122_CR22","unstructured":"U. Vishkin, Synchronous parallel computation\u2014a survey, TR-71, Department of Computer Science, Courant Institute, New York University, 1983."},{"key":"BF01762122_CR23","doi-asserted-by":"crossref","unstructured":"U. Vishkin, Randomized speed-ups in parallel computation,Proceedings of the 16th ACM Symposium on Theory of Computing, 1984, pp. 230\u2013239.","DOI":"10.1145\/800057.808686"},{"key":"BF01762122_CR24","doi-asserted-by":"crossref","unstructured":"P. Weiner, Linear pattern matching algorithm,Proceedings of the 14th IEEE Symposium on Switching and Automata Theory, 1973, pp. 1\u201311.","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01762122.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01762122\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01762122","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T19:26:46Z","timestamp":1586287606000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01762122"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,11]]},"references-count":24,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1988,11]]}},"alternative-id":["BF01762122"],"URL":"https:\/\/doi.org\/10.1007\/bf01762122","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,11]]}}}