{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T21:51:43Z","timestamp":1771883503710,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540578116","type":"print"},{"value":"9783540483373","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57811-0_3","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:24:15Z","timestamp":1330262655000},"page":"22-32","source":"Crossref","is-referenced-by-count":7,"title":["On a parallel-algorithms method for string matching problems (overview)"],"prefix":"10.1007","author":[{"given":"Suleyman Cenk","family":"Sahinalp","sequence":"first","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,26]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF01762122","volume":"3","author":"A. Apostolico","year":"1988","unstructured":"A. Apostolico, C. Iliopoulos, G. M. Landau, B. Schieber, and U. Vishkin, Parallel Construction of a Suffix Tree with Applications, In Algorithmica, 3: 347\u2013365, 1988.","journal-title":"Algorithmica"},{"issue":"2","key":"3_CR2","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1137\/0222017","volume":"22","author":"O. Berkman","year":"1993","unstructured":"O. Berkman, and U. Vishkin, Recursive star-tree parallel data-structure, In SIAM J. Computing, 22,2: 221\u2013242, 1993.","journal-title":"SIAM J. Computing"},{"key":"3_CR3","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0890-5401(91)90031-V","volume":"94","author":"P. C. P. P. Bhatt","year":"1991","unstructured":"P. C. P. Bhatt, K. Diks, T. Hagerup, V. C. Prasad, T. Radzik, and S. Saxena, Improved Deterministic Parallel Integer Sorting, In Information and Computation, 94: 29\u201347, 1991.","journal-title":"Information and Computation"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"G. E. Blelloch, C. E. Leiserson, B. M. Maggs, C. G. Plaxton, S. J Smith, M. Zagha, A Comparison of Sorting Algorithms for the Connection Machine CM-2, In Proceedings of the 3\n\n                  rd\n                \nAnnual ACM Symposium on Parallel Algorithms and Architectures, pages 3\u201316, 1991.","DOI":"10.1145\/113379.113380"},{"key":"3_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 Parallel List Ranking, In Information and Control, 70: 32\u201353, 1986.","journal-title":"Information and Control"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"R. Cole, and U. Vishkin, Deterministic Coin Tossing and Accelerating Cascades: Micro and Macro Techniques for Designing Parallel Algorithms, In Proceedings of the 18\n\n                  th\n                \nAnnual ACM Symposium on the Theory of Computing, pages 206\u2013219, 1986.","DOI":"10.1145\/12130.12151"},{"key":"3_CR7","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/S0019-9958(85)80031-0","volume":"67","author":"Z. Galil","year":"1985","unstructured":"Z. Galil, Optimal Parallel Algorithms for String Matching, In Information and Control, 67: 144\u2013157, 1985.","journal-title":"Information and Control"},{"key":"3_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, In Proceedings of the 4\n\n                  th\n                \nAnnual ACM Symposium on the Theory of Computing, pages 125\u2013136, 1972.","DOI":"10.1145\/800152.804905"},{"issue":"4","key":"3_CR9","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1016\/0196-6774(91)90034-V","volume":"12","author":"Y. Matias","year":"1991","unstructured":"Y. Matias, and U. Vishkin, On Parallel Hashing and Integer Sorting, In Journal of Algorithms, 12,4: 573\u2013606, 1991.","journal-title":"Journal of Algorithms"},{"key":"3_CR10","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 \u2014 Economical Suffix Tree Construction Algorithm, In Journal of the ACM, 23: 262\u2013272, 1976.","journal-title":"Journal of the ACM"},{"key":"3_CR11","unstructured":"K. Mehlhorn, R. Sundar, and C. Uhrig, Maintaining Dynamic Sequences under Equality \u2014 Tests in Polylogarithmic Time, to appear In Proceedings of the 5th Annual ACM \u2014 SIAM Symposium on Discrete Algorithms, 1994."},{"key":"3_CR12","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1137\/0218041","volume":"18","author":"S. Rajasekaran","year":"1989","unstructured":"S. Rajasekaran, and J. H. Reif, Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms, In SIAM Journal of Computing, 18: 594\u2013607, 1989.","journal-title":"SIAM Journal of Computing"},{"key":"3_CR13","unstructured":"S. C. Sahinalp, and U. Vishkin, Symmetry Breaking in Suffix Tree Construction, In preparation"},{"key":"3_CR14","doi-asserted-by":"crossref","first-page":"1253","DOI":"10.1137\/0217079","volume":"17","author":"B. Schieber","year":"1988","unstructured":"B. Schieber, and U. Vishkin, On Finding Lowest Common Ancestors: Simplification and Parallelization, In SIAM Journal of Computing, 17: 1253\u20131262, 1988.","journal-title":"SIAM Journal of Computing"},{"key":"3_CR15","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0019-9958(85)80028-0","volume":"67","author":"U. Vishkin","year":"1985","unstructured":"U. Vishkin, Optimal Parallel Pattern Matching in Strings, In Information and Control, 67: 91\u2013113, 1985.","journal-title":"Information and Control"},{"key":"3_CR16","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1137\/0220002","volume":"20","author":"U. Vishkin","year":"1991","unstructured":"U. Vishkin, Deterministic Sampling \u2014 A New Technique for Fast Pattern Matching, In SIAM Journal of Computing, 20: 22\u201340, 1991.","journal-title":"SIAM Journal of Computing"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"P. Weiner, Linear Pattern Matching Algorithm, In Proceedings of the 14\n\n                  th\n                \nIEEE Symposium on Switching and Automata Theory, pages 1\u201311, 1973.","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57811-0_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:08:19Z","timestamp":1619572099000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57811-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578116","9783540483373"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-57811-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994]]}}}