{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:58:46Z","timestamp":1725663526280},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540180883"},{"type":"electronic","value":"9783540477471"}],"license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18088-5_26","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T14:26:38Z","timestamp":1330179998000},"page":"314-325","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Parallel construction of a suffix tree"],"prefix":"10.1007","author":[{"given":"Gad M.","family":"Landau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baruch","family":"Schieber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uzi","family":"Vishkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"26_CR1","first-page":"85","volume":"12","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, 1985, 85\u201396.","journal-title":"Computer and System Sciences"},{"key":"26_CR2","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":"26_CR3","unstructured":"A. Apostolico and C. Iliopoulos, \"Parallel log-time construction of suffix trees\", preprint, Dept. of Computer Science, Purdue University, Oct. 1986."},{"key":"26_CR4","doi-asserted-by":"publisher","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":"26_CR5","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":"26_CR6","doi-asserted-by":"crossref","unstructured":"R. Cole and U. Vishkin, \"Approximate and exact parallel scheduling with applications to list, tree and graph problems\", Proc. 27th Annual Symp. on Foundations of Computer Science, 1986, 478\u2013491.","DOI":"10.1109\/SFCS.1986.10"},{"key":"26_CR7","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 ACM, 27 (1980), 831\u2013838.","journal-title":"Journal of the ACM"},{"key":"26_CR8","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\", Proc. 4th ACM Symposium on Theory of Computing, 1972, 125\u2013136.","DOI":"10.1145\/800152.804905"},{"key":"26_CR9","doi-asserted-by":"crossref","first-page":"942","DOI":"10.1109\/TC.1983.1676138","volume":"c-32","author":"C. P. Kruskal","year":"1983","unstructured":"C.P. Kruskal, \"Searching, merging and sorting in parallel computation\", IEEE Trans. Computers, c-32 (1983), 942\u2013946.","journal-title":"IEEE Trans. Computers"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"G.M. Landau and U. Vishkin, \"Introducing efficient parallelism into approximate string matching\", Proc. 18th ACM Symposium on Theory of Computing, 1986, 220\u2013230.","DOI":"10.1145\/12130.12152"},{"key":"26_CR11","unstructured":"G.M. Landau, B. Schieber and U. Vishkin, \"Parallel construction of a suffix tree\". TR 53\/86, The Moise and Frida Eskenasy Institute of Computer Science, Tel Aviv University (1986)."},{"key":"26_CR12","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 (1976), 262\u2013272.","journal-title":"Journal of the ACM"},{"key":"26_CR13","doi-asserted-by":"crossref","first-page":"1316","DOI":"10.1007\/BF01084395","volume":"23","author":"A. O. Slisenko","year":"1983","unstructured":"A.O. Slisenko, \"Detection of periodicities and string matching in real time\", Journal of Soviet Mathematics, 23 (1983), 1316\u20131387.","journal-title":"Journal of Soviet Mathematics"},{"key":"26_CR14","doi-asserted-by":"publisher","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":"26_CR15","unstructured":"B. Schieber and U. Vishkin, \"On finding lowest common ancestors: simplification and parallelization\", TR 63\/87, The Moise and Frida Eskenasy Institute of Computer Science, Tel Aviv University (1987)."},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1137\/0204030","volume":"4","author":"L. G. Valiant","year":"1975","unstructured":"L.G. Valiant, \"Parallelism in comparison problems\", SIAM J. Comput., 4 (1975), 348\u2013355.","journal-title":"SIAM J. Comput."},{"key":"26_CR17","unstructured":"U. Vishkin, \"Synchronous parallel computation \u2014 a survey\", TR-71, Dept. of Computer Science, Courant Institute, NYU, 1983."},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"U. Vishkin, \"Randomized speed-ups in parallel computation\", Proc. 16th ACM Symposium on Theory of Computing, 1984, 230\u2013239.","DOI":"10.1145\/800057.808686"},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"P. Weiner \"Linear Pattern Matching Algorithm\", Proc. 14th IEEE Symposium on Switching and Automata Theory, 1973, 1\u201311.","DOI":"10.1109\/SWAT.1973.13"}],"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\/3-540-18088-5_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T21:02:19Z","timestamp":1578517339000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18088-5_26"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540180883","9783540477471"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-18088-5_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]},"assertion":[{"value":"29 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}