Walter F. Tichy
- 1 GOSLZNG, J.A. A redisplay algorithm. In Proceedings of the ACM SIG-PLAN SIGOA Symposium on Text Manipulation (Portland, Ore., June 8-10). ACM, New York, 1981, pp 123-129. Google Scholar
- 2 HECKEL, P. A technique for isolating differences between files. Commun. ACM 21, 4 (Apr. 1978), 264-268. Google Scholar
- 3 HIRSCHBERG, D.S. A linear space algorithm for computing maximal common subsequences. Commun. ACM 18, 6 (June 1975), 341-343. Google Scholar
- 4 HIRSCHBERO, D. S. Algorithm for the longest common subsequence problem. J. ACM 24, 4 (Oct. 1977), 664-675. Google Scholar
- 5 HUNT, J. W., AND MCILROY, M.D. An algorithm for differential file comparison. Computing Science Tech. Rep. 41. AT&T Bell Laboratories, Murray Hill, N.J., June 1976.Google Scholar
- 6 HUNT, J. W., AND SZYMANSKI, T.G. A fast algorithm for computing longest common subsequences. Commun. ACM 20, 5 (May 1977), 350-353. Google Scholar
- 7 LEBLANG, D. B., AND CHASE, R. P. Computer aided software engineering in a distributed workstation environment. SIGPLAN Not. (ACM) 19, 5 (May 1984), 104-112. Google Scholar
- 8 LOWRANCE, R., AND WAGNER, R.A. An extension of the string-to-string correction problem. J. ACM 22, 2 (Apr. 1975), 177-183. Google Scholar
- 9 MASEK, W. J., AND PATERSON, M.S. How to compute string-edit distances quickly. In Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison, D. Sankoff and J. B. Kruskal, Eds. Addison-Wesley, Reading, Mass., 1983, pp. 337-349.Google Scholar
- 10 MCCREIGHT, E.M. A space-economic suffix tree construction algorithm. J. ACM 23, 2 (Apr. 1976), 262-272. Google Scholar
- 11 NAKATSU, N., KAMBAYASHI, Y., AND YAJIMA, S. A longest common subsequence algorithm for similar text strings. Act. Inf. 18 (1982), 171-179.Google Scholar
- 12 POPEK, G., WALKER, B., ENGLISH, R., KLINE, C., AND TmEL, G. The LOCUS distributed operating system. Oper. Syst. Rev. 17, 5 (Oct. 1983), 49-70. Google Scholar
- 13 ROCHKIND, M. J. The source code control system. IEEE Trans. Softw. Eng. SE-1, 4 {Dec. 1975), 364-370.Google Scholar
- 14 SANKOFF, D. Matching sequences under deletion/insertion constraints. Proc. Nat. Acad. Sci. (USA) 69, 1 (Jan. 1972), 4-6.Google Scholar
- 15 SANKOFF, D., AND KRUSKAL, J.B. Time Warps, String Edits, and Macromolecules: The Theory of Sequence Comparison. Addison-Wesley, Reading, Mass., 1983.Google Scholar
- 16 TrollY, W.F. Design, implementation, evaluation of a revision control system. In Proceedings of the 6th International Conference on Software Engineering (Tokyo, Japan, Sept. 13-16). ACM New York, 1982, pp 58-67. Google Scholar
- 17 WAGNER, R. A., AND FISHER, M.J. The string-to-string correction problem. J. ACM 21, 1 (Jan. 1973), 168-173. Google Scholar
Index Terms
- The string-to-string correction problem with block moves
Recommendations
The String-to-String Correction Problem
The string-to-string correction problem is to determine the distance between two strings as measured by the minimum cost sequence of “edit operations” needed to change the one string into the other. The edit operations investigated allow changing one ...
Resequencing a Set of Strings Based on a Target String
Given a set S={S1,S2, ,Sl} of l strings, a text T, and a natural number k, find a string M, which is a concatenation of k strings (not necessarily distinct, i.e., a string in S may occur more than once in M) from S, whose longest common subsequence with ...
Locating maximal approximate runs in a string
An exact run in a string T is a non-empty substring of T that is a repetition of a smaller substring possibly followed by a prefix of it. Finding maximal exact runs in strings is an important problem and therefore a well-studied one in the area of ...
Comments