The String-to-String Correction Problem
Journal of the ACM (JACM)
Bounds for the String Editing Problem
Journal of the ACM (JACM)
A fast algorithm for computing longest common subsequences
Communications of the ACM
A linear space algorithm for computing maximal common subsequences
Communications of the ACM
A system for interactive viewing of structured documents
Communications of the ACM
Row replacement algorithms for screen editors
ACM Transactions on Programming Languages and Systems (TOPLAS)
Delta algorithms: an empirical analysis
ACM Transactions on Software Engineering and Methodology (TOSEM)
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Interactive Editing Systems: Part II
ACM Computing Surveys (CSUR)
The string-to-string correction problem with block moves
ACM Transactions on Computer Systems (TOCS)
A guided tour to approximate string matching
ACM Computing Surveys (CSUR)
Reasoning About Interactive System
IEEE Transactions on Software Engineering
Polylith: An environment to support management of tool interfaces
SLIPE '85 Proceedings of the ACM SIGPLAN 85 symposium on Language issues in programming environments
Autonomous authoring tools for hypertext
ACM Computing Surveys (CSUR)
| Hi-index | 0.02 |
This paper presents an algorithm for updating the image displayed on a conventional video terminal. It assumes that the terminal is capable of doing the usual insert/delete line and insert/delete character operations. It takes as input a description of the image currently on the screen and a description of the new image desired and produces a series of operations to do the desired transformation in a near-optimal manner. The algorithm is interesting because it applies results from the theoretical string-to-string correction problem (a generalization of the problem of finding a longest common subsequence), to a problem that is usually approached with crude ad-hoc techniques.