{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T08:39:11Z","timestamp":1787387951481,"version":"build-2736575974"},"reference-count":24,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1990,10]]},"abstract":"<jats:p>The string editing problem for input strings x and y consists of transforming x into y by performing a series of weighted edit operations on x of overall minimum cost. An edit operation on x can be the deletion of a symbol from x, the insertion of a symbol in x or the substitution of a symbol of x with another symbol. This problem has a well-known $O(|x||y|)$ time-sequential solution. Efficient PRAM parallel algorithms for the string editing problem are given. If $m = \\min (|x|,|y|)$ and $n = \\max (|x|,|y|)$, then the CREW bound is $O(\\log m \\log n)$ time with $O({{mn} \/ {\\log m}})$ processors. The CROW bound is $O(\\log n(\\log \\log m)^{2})$ time with $O(mn\/ \\log \\log m)$ processors. In all algorithms, space is $O(mn)$.<\/jats:p>","DOI":"10.1137\/0219066","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:33:47Z","timestamp":1109226827000},"page":"968-988","source":"Crossref","is-referenced-by-count":117,"title":["Efficient Parallel Algorithms for String Editing and Related Problems"],"prefix":"10.1137","volume":"19","author":[{"given":"Alberto","family":"Apostolico","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mikhail J.","family":"Atallah","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lawrence L.","family":"Larmore","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Scott","family":"McFaddin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,31]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321922"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840359"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"A. Aggarwal, J. Park,  Notes on searching in multidimensional monotone arrays,  Proc. 29th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Washington, DC,  1988,  497\u2013512","DOI":"10.1109\/SFCS.1988.21966"},{"key":"R4","unstructured":"A. Aggarwal, J. Park,  Parallel searching in multidimensional monotone arrays,  1989, unpublished manuscript, May 31"},{"key":"R5","volume-title":"The design and analysis of computer algorithms","author":"Aho Alfred V.","year":"1975"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"M. J. Atallah, R. Cole, M. T. Goodrich,  Cascading divide-and-conquer: A technique for designing parallel algorithms,  Proc. 28th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Washington, DC,  1987,  151\u2013160","DOI":"10.1109\/SFCS.1987.12"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1145\/321812.321815"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"R. Cole,  Parallel merge sort,  Proc. 27th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Washington, DC,  1986,  511\u2013516","DOI":"10.1109\/SFCS.1986.41"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1145\/359842.359846"},{"key":"R10","unstructured":"Z. M. Kedem, H. Fuchs,  On finding several shortest paths in certain graphs,  Proc. 18th Allerton Conference on Communication, Control, and Computing,  1980,  677\u2013683, October"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322232"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"G. Landau, U. Vishkin,  Introducing efficient parallelism into approximate string matching and a new serial algorithm,  Proc. 18th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, New York,  1986,  220\u2013230","DOI":"10.1145\/12130.12152"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1007\/BF02459496"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(80)90002-1"},{"key":"R15","unstructured":"T. R. Mathies,  A fast parallel algorithm to determine edit distance, Tech. Report, CMU-CS-88-130, Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA,  1988, April"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(70)90057-4"},{"key":"R17","unstructured":"S. Ranka, S. Sahni,  String editing on an SIMD hypercube multicomputer, Tech. Report 88-29, Department of Computer Science, University of Minnesota, Minneapolis, MN, March 1988; J. Parallel Distributed Comput., submitted"},{"key":"R18","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.69.1.4"},{"key":"R19","volume-title":"Time warps, string edits, and macromolecules: the theory and practice of sequence comparison","author":"Sankoff D.","year":"1983"},{"key":"R20","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(74)90050-8"},{"key":"R21","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(80)90016-4"},{"key":"R22","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(85)90023-9"},{"key":"R23","doi-asserted-by":"publisher","DOI":"10.1145\/321796.321811"},{"key":"R24","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321923"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0219066","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:44:25Z","timestamp":1787337865000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0219066"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,10]]},"references-count":24,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1990,10]]}},"alternative-id":["10.1137\/0219066"],"URL":"https:\/\/doi.org\/10.1137\/0219066","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,10]]}}}