Abstract
The string merging problem is to determine a merged string from a given set of strings. The distinguishing property of a solution is that the total cost of editing all of the given strings into this solution is minimal. Necessary and sufficient conditions are presented for the case where this solution matches the solution to the string-to-string correction problem. A special case where deletion is the only allowed edition operation is shown to have the longest common subsequence of the strings as its solution.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. V. Aho, D. S. Hirschberg and J. D. Ullman.The longest common subsequence problem. J. ACM. 23,1 (Jan. 1976), 1–12.
V. L. Artazarov, E. A. Dinic, M. A. Kronrod and I. A. Faradzev.On economical construction of the transitive closure of an oriented graph. Soviet Math Dokl. 11,5 (1970), 1209–1210.
S. Ginsburg and S. A. Greibach,Abstract families of languages. In studies inAbstract Families of Languages, Memoir 87, Amer. Math. Soc., Providence, R.I., 1969, 1–32.
D. S. Hirschberg.A linear space algorithm for computing maximal common subsequences. Comm. ACM. 18,6 (June 1975), 341–343.
J. W. Hunt and T. G. Szymanski.A fast algorithm for computing longest common subsequences. Comm. ACM. 20,5 (May 1977), 350–353.
R. Lowrance and R. A. Wagner.An extension of the string-to-string correction problem. J. ACM 22,2 (April 1975), 177–183.
D. Maier.The complexity of some problems on subsequences and supersequences. J. ACM. 25, 2 (April 1978), 322–336.
W. J. Masek and M. S. Paterson.A faster algorithm computing string edit distances. TM-105, MIT Laboratory for Computer Science, (May 1978), 1–26.
D. Sankoff.Matching sequences under deletion/insertion constraints. Proc. Nat. Acad. Sci. USA 69,1 (Jan. 1972), 4–6.
P. H. Sellers.An algorithm for the distance between two finite sequences. J. Combin. Theory (A), 16 (1974), 253–258.
R. A. Wagner and M. J. Fischer.The string to string correction problem. J. ACM 21, 1 (Jan. 1974), 168–173.
C. K. Wong and A. K. Chandra.Bounds for the string editing problem. J. ACM. 23,1 (Jan. 1976), 13–16.
Author information
Authors and Affiliations
Additional information
This research was supported by the U.S. Army Research Office.
Rights and permissions
About this article
Cite this article
Itoga, S.Y. The string merging problem. BIT 21, 20–30 (1981). https://doi.org/10.1007/BF01934067
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01934067