The string-to-string correction problem with block moves

ACM Transactions on Computer Systems (TOCS)

Volumn 2, Issue 4, 1984, Pages 309-321

  Tichy, Walter F ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

block moves; longest common subsequences; pattern matching; revision control; source control; string deltas; string edits

Indexed keywords

EID: 84976728067     PISSN: 07342071     EISSN: 15577333     Source Type: Journal    
DOI: 10.1145/357401.357404     Document Type: Article

References (17)

1. GOSLING, 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.
2. HECKEL, P. A technique for isolating differences between files. Commun. ACM 21, 4 (Apr. 1978), 264-268.
3. HIRSCHBERG, D.S. A linear space algorithm for computing maximal common subsequences. Commun. ACM 18, 6 (June 1975), 341-343.
4. HIRSCHBERG, D. S. Algorithm for the longest common subsequence problem. J. ACM 24, 4 (Oct. 1977), 664-675.
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.
6. HUNT, J. W., AND SZYMANSKI, T.G. A fast algorithm for computing longest common subsequences. Commun. ACM 20, 5 (May 1977), 350-353.
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.
8. LOWRANCE, R., AND WAGNER, R.A. An extension of the string-to-string correction problem. J. ACM 22, 2 (Apr. 1975), 177-183.
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.
10. MCCREIGHT, E.M. A space-economic suffix tree construction algorithm. J. ACM 23, 2 (Apr. 1976), 262-272.
11. NAKATSU, N., KAMBAYASHI, V., AND YAJIMA, S. A longest common subsequence algorithm for similar text strings. Act. Inf. 18 (1982), 171-179.
12. POPEK, G., WALKER, B., ENGLISH, R., KLINE, C., AND THIEL, G. The LOCUS distributed operating system. Oper. Syst. Rev. 17, 5 (Oct. 1983), 49-70.
13. ROCHKIND, M. J. The source code control system. IEEE Trans. Softw. Eng. SE-1, 4 (Dec. 1975), 364-370.
14. SANKOFF, D. Matching sequences under deletion/insertion constraints. Proc. Nat. Acad. Sci. (USA) 69, 1 (Jan. 1972), 4-6.
15. SANKOFF, D., AND KRUSKAL, J.B. Time Warps, String Edits, and Macromolecules: The Theory of Sequence Comparison. Addison-Wesley, Reading, Mass., 1983.
16. TICHY, 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.
17. WAGNER, R. A., AND FISHER, M.J. The string-to-string correction problem. J. ACM 21, 1 (Jan. 1973), 168-173.