{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:23:41Z","timestamp":1725665021369},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540632207"},{"type":"electronic","value":"9783540692140"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63220-4_53","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:19:14Z","timestamp":1330298354000},"page":"90-101","source":"Crossref","is-referenced-by-count":3,"title":["External inverse pattern matching"],"prefix":"10.1007","author":[{"given":"Leszek","family":"Gasieniec","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Indyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Krysta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"issue":"6","key":"9_CR1","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1137\/0216067","volume":"16","author":"K. Abrahamson","year":"1987","unstructured":"K. Abrahamson, Generalized String Matching, SIAM Journal on Computing, 16(6):1039\u20131051, 1987.","journal-title":"SIAM Journal on Computing"},{"key":"9_CR2","unstructured":"Amihood Amir, Alberto Apostolico and Moshe Lewenstein, Inverse Pattern Matching, Manuscript, to appear in Journal of Algorithms."},{"key":"9_CR3","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF01762122","volume":"3","author":"A. Apostolico","year":"1988","unstructured":"A. Apostolico, C. Ilioppoulos, G.M. Landau, B. Schieber and U. Vishkin, Parallel construction of a suffix tree with applications, Algorithmica, 3:347\u2013365, 1988.","journal-title":"Algorithmica"},{"key":"9_CR4","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0217049","volume":"4","author":"R. Cole","year":"1988","unstructured":"R. Cole, Parallel merge sort, SIAM, J. Computing, 4(1988), pp 770\u2013785.","journal-title":"SIAM, J. Computing"},{"key":"9_CR5","unstructured":"M.J. Fischer and M.S. Paterson, String matching and other products, Complexity of Computation, R.M. Karp (editor), SIAM-AMS Proceedings, 7:113\u2013125, 1974."},{"key":"9_CR6","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1145\/367390.367400","volume":"3","author":"E. Fredkin","year":"1962","unstructured":"E. Fredkin, Trie Memory, Communications of the ACM, 3:490\u2013499, 1962.","journal-title":"Communications of the ACM"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"H.N. Gabow, J.L. Bentley and R.E. Tarjan, Scaling and related techniques for geometry problems, In Proceedings of 16th ACM Symposium on Theory of Computing (STOC), pp. 135\u2013143, 1984.","DOI":"10.1145\/800057.808675"},{"key":"9_CR8","unstructured":"A. Gibbons and W. Rytter, Efficient Parallel Algorithms, Cambridge University Press, 1988."},{"issue":"2","key":"9_CR9","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","volume":"26","author":"R.W. Hamming","year":"1950","unstructured":"R.W. Hamming, Error detecting and error correcting codes, Bell. Sys. Tech. Journal, 26(2): 147\u2013160, 1950.","journal-title":"Bell. Sys. Tech. Journal"},{"key":"9_CR10","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"D. Harel and R.E. Tarjan, Fast algorithms for finding nearest common ancestors, SIAM Journal on Computing, 13:338\u2013355, 1984.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"9_CR11","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0020-0190(93)90177-B","volume":"48","author":"H. Karloff","year":"1993","unstructured":"H. Karloff, Fast algorithms for approximately counting mismatches, Information Processing Letters, 48(2):53\u201360, 1993.","journal-title":"Information Processing Letters"},{"key":"9_CR12","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D.E. Knuth","year":"1977","unstructured":"D.E. Knuth, J.H. Morris, and V.B. Pratt, Fast pattern matching in strings, SIAM J. Comput. 6 (1977), 323\u2013350.","journal-title":"SIAM J. Comput."},{"key":"9_CR13","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BFb0040379","volume":"319","author":"B. Schieber","year":"1988","unstructured":"B. Schieber and U. Vishkin, On finding lower common ancestors: simplification and parallelization, In Proceedings of 3rd Aegean Workshop on VLSI Algorithms and Architecture, LNCS 319:111\u2013123, 1988.","journal-title":"Proceedings of 3rd Aegean Workshop on VLSI Algorithms and Architecture, LNCS"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"P. Weiner, Linear pattern matching algorithms, In Proceedings of 14th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 1\u201311, 1973.","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63220-4_53.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:42:54Z","timestamp":1619574174000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63220-4_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540632207","9783540692140"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-63220-4_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}