{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T16:20:10Z","timestamp":1780330810852,"version":"3.54.1"},"reference-count":38,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1988,3,1]],"date-time":"1988-03-01T00:00:00Z","timestamp":573177600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1988,3,1]],"date-time":"1988-03-01T00:00:00Z","timestamp":573177600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2005,6,30]],"date-time":"2005-06-30T00:00:00Z","timestamp":1120089600000},"content-version":"vor","delay-in-days":6330,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Complexity"],"published-print":{"date-parts":[[1988,3]]},"DOI":"10.1016\/0885-064x(88)90008-8","type":"journal-article","created":{"date-parts":[[2004,11,6]],"date-time":"2004-11-06T13:01:23Z","timestamp":1099746083000},"page":"33-72","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":98,"title":["Data structures and algorithms for approximate string matching"],"prefix":"10.1016","volume":"4","author":[{"given":"Z","family":"Galil","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"R","family":"Giancarlo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0885-064X(88)90008-8_BIB1","series-title":"Combinatorial Algorithms on Words","first-page":"85","article-title":"The myriad virtues of subword trees","volume":"Vol. 12","author":"Apostolico","year":"1984"},{"key":"10.1016\/0885-064X(88)90008-8_BIB2","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1137\/0216067","article-title":"Generalized string matching","volume":"16","author":"Abrahamson","year":"1984","journal-title":"SIAM J. on Computing"},{"key":"10.1016\/0885-064X(88)90008-8_BIB3","first-page":"1209","article-title":"On economic construction of the transitive closure of a directed graph","volume":"11","author":"Arlazarov","year":"1970","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0885-064X(88)90008-8_BIB4","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF01840365","article-title":"The longest common subsequent problem revisited","volume":"2","author":"Apostolico","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/0885-064X(88)90008-8_BIB5","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0885-064X(88)90008-8_BIB6","unstructured":"APOSTOLICO, A., ILIOPOULIS, C., LANDAU, G. M., SHIEBER, B., AND Vishkin, U., Parallel construction of a suffix tree, Algorithmica, to appear."},{"key":"10.1016\/0885-064X(88)90008-8_BIB7","article-title":"String Matching with Context Dependent Errors","author":"Bertossi","year":"1987"},{"key":"10.1016\/0885-064X(88)90008-8_BIB8","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1145\/359842.359859","article-title":"A fast string searching algorithm","volume":"20","author":"Boyer","year":"1977","journal-title":"Comm. ACM"},{"key":"10.1016\/0885-064X(88)90008-8_BIB9","series-title":"Proceedings, 27th IEEE FOCS","first-page":"511","article-title":"Parallel merge sort","author":"Cole","year":"1986"},{"key":"10.1016\/0885-064X(88)90008-8_BIB10","series-title":"Combinatorial Algorithms on Words","first-page":"31","article-title":"Optimal factor transducers","volume":"Vol. 12","author":"Crochemore","year":"1984"},{"key":"10.1016\/0885-064X(88)90008-8_BIB11","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","article-title":"Parallel prefix computation","volume":"27","author":"Fischer","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0885-064X(88)90008-8_BIB12","series-title":"Complexity of Computation","first-page":"113","article-title":"String matching and other products","volume":"7","author":"Fischer","year":"1974"},{"key":"10.1016\/0885-064X(88)90008-8_BIB13","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321796.321811","article-title":"The string to string correction problem","volume":"21","author":"Fischer","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/0885-064X(88)90008-8_BIB14","series-title":"Proceedings, 10th ACM STOC","first-page":"114","article-title":"Parallelism in random access machines","author":"Fortune","year":"1978"},{"key":"10.1016\/0885-064X(88)90008-8_BIB15","series-title":"Combinatorial Algorithms on Words","first-page":"1","article-title":"Open problems in stringology","volume":"Vol. 12","author":"Galil","year":"1984"},{"key":"10.1016\/0885-064X(88)90008-8_BIB16","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1145\/8307.8309","article-title":"Improved string matching with k mismatches","volume":"17","author":"Galil","year":"1986","journal-title":"Sigact News"},{"key":"10.1016\/0885-064X(88)90008-8_BIB17","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0304-3975(87)90042-9","article-title":"Parallel string matching with k mismatches","volume":"51","author":"Galil","year":"1987","journal-title":"Theoret. Comp. Sci."},{"key":"10.1016\/0885-064X(88)90008-8_BIB18","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1145\/322374.322382","article-title":"An efficient general purpose parallel computer","volume":"30","author":"Galil","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/0885-064X(88)90008-8_BIB19","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/360825.360861","article-title":"A linear space algorithm for computing maximal common subsequences","volume":"18","author":"Hirschberg","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/0885-064X(88)90008-8_BIB20","article-title":"Fast Sequential Algorithms to Find Shuffle Minimizing and Shortest Paths in a Shuffle Exchange Network","author":"Hershberger","year":"1985"},{"key":"10.1016\/0885-064X(88)90008-8_BIB21","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1145\/359581.359603","article-title":"A fast algorithm for computing longest common subsequences","volume":"20","author":"Hunt","year":"1977","journal-title":"Comm. ACM"},{"key":"10.1016\/0885-064X(88)90008-8_BIB22","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","article-title":"Fast algorithms for finding nearest common ancestors","volume":"13","author":"Harel","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0885-064X(88)90008-8_BIB23","first-page":"520","article-title":"Distinguishing an approximate word's inclusion on Turing machine in real time","volume":"48","author":"Ivanov","year":"1984","journal-title":"Izv. Acad. Nauk USSR Ser. Mat."},{"key":"10.1016\/0885-064X(88)90008-8_BIB24","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1137\/0206024","article-title":"Fast pattern matching in strings","volume":"6","author":"Knuth","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0885-064X(88)90008-8_BIB25","article-title":"The Art of Computer Programming","author":"Knuth","year":"1973"},{"key":"10.1016\/0885-064X(88)90008-8_BIB26","article-title":"String Matching in Erroneous Input","author":"Landau","year":"1986"},{"key":"10.1016\/0885-064X(88)90008-8_BIB27","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions and reversals","volume":"6","author":"Levenshtein","year":"1966","journal-title":"Soviet Phys. Dokl."},{"key":"10.1016\/0885-064X(88)90008-8_BIB28","series-title":"Proceedings, 26th IEEE FOCS","first-page":"126","article-title":"Efficient string matching in the presence of errors","author":"Landau","year":"1985"},{"key":"10.1016\/0885-064X(88)90008-8_BIB29","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0304-3975(86)90178-7","article-title":"Efficient string matching with k mismatches","volume":"43","author":"Landau","year":"1986","journal-title":"Theoret. Comput. Sri."},{"key":"10.1016\/0885-064X(88)90008-8_BIB30","series-title":"Proceedings, 18th ACM STOC","first-page":"220","article-title":"Introducing efficient parallelism into approximate string matching and a new serial algorithm","author":"Landau","year":"1986"},{"key":"10.1016\/0885-064X(88)90008-8_BIB31","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","article-title":"A space economical suffix tree construction algorithm","volume":"23","author":"McCreight","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0885-064X(88)90008-8_BIB32","article-title":"Data Structures and Algorithms. 1. Sorting and Searching","author":"Mehlhorn","year":"1984"},{"key":"10.1016\/0885-064X(88)90008-8_BIB33","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/0022-0000(80)90002-1","article-title":"A faster algorithm computing string edit distances","volume":"20","author":"Masek","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0885-064X(88)90008-8_BIB34","article-title":"Incremental Alignment Algorithms and Their Applications","author":"Myers","year":"1986"},{"key":"10.1016\/0885-064X(88)90008-8_BIB35","article-title":"On Finding Lowest Common Ancestors: Simplification and Parallelization","author":"Schieber","year":"1986"},{"key":"10.1016\/0885-064X(88)90008-8_BIB36","series-title":"Proceedings, Int. Conf. on Foundations of Computer Science","first-page":"487","article-title":"On approximate string matching","author":"Ukkonen","year":"1983"},{"key":"10.1016\/0885-064X(88)90008-8_BIB37","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0196-6774(85)90023-9","article-title":"Finding approximate patterns in strings","volume":"6","author":"Ukkonen","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/0885-064X(88)90008-8_BIB38","series-title":"Proceedings, 14th Symposium on Switching and Automata Theory","first-page":"1","article-title":"Linear pattern matching algorithms","author":"Wiener","year":"1973"}],"container-title":["Journal of Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X88900088?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X88900088?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:53:30Z","timestamp":1757516010000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0885064X88900088"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,3]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,3]]}},"alternative-id":["0885064X88900088"],"URL":"https:\/\/doi.org\/10.1016\/0885-064x(88)90008-8","relation":{},"ISSN":["0885-064X"],"issn-type":[{"value":"0885-064X","type":"print"}],"subject":[],"published":{"date-parts":[[1988,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Data structures and algorithms for approximate string matching","name":"articletitle","label":"Article Title"},{"value":"Journal of Complexity","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0885-064X(88)90008-8","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1988 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}