A technique for isolating differences between files

@article{Heckel1978ATF,
  title={A technique for isolating differences between files},
  author={Paul Heckel},
  journal={Commun. ACM},
  year={1978},
  volume={21},
  pages={264-268}
}
  • P. Heckel
  • Published 1 April 1978
  • Computer Science
  • Commun. ACM
A simple algorithm is described for isolating the differences between two files. [...] Key Method Another application of this algorithm merges files containing independently generated changes into a single file. The algorithm can also be used to generate efficient encodings of a file in the form of the differences between itself and a given “datum” file, permitting reconstruction of the original file from the diference and datum files.Expand
An Application of File-Comparison Algorithms to the Study of Program Editors
TLDR
A high-level editing sequence for a particular text editor and a particular editing task is automatically produced and is found to be comparable to typical user-produced editing sequences. Expand
Diff library in Eiffel ( Diffeif )
The Diffeif library is a library which provides functionality for computing the difference of two code or text chunks and visualize it in a GUI. The library is implemented in and for Eiffel. FindingExpand
Delta storage for arbitrary non-text files
TLDR
This paper deals with a technique for generating deltas between arbitrary files without any presumptions about the file structure and measures of exwution time and the size of resulting delta scripts conclude the paper. Expand
Identifying syntactic differences between two programs
  • W. Yang
  • Computer Science
  • Softw. Pract. Exp.
  • 1991
TLDR
A comparison algorithm is developed that can point out the differences between two programs more accurately than previous text comparison tools and is based on a dynamic programming scheme. Expand
Bidirectional delta files
TLDR
Two main strategies for producing an efficient bidirectional delta file in terms of the memory storage it requires are presented; a quadratic time, optimal, dynamic programming algorithm, and a linear time, greedy algorithm. Expand
Computation and Visualization of Differences between two XML Music Score Files
TLDR
The goal is to implement for music scores a utility similar to the Unix diff command for text files to identify differences between two score files which are relatively similar, corresponding to the intuitive notion of difference. Expand
Direct merging of delta encoded files
  • Dana Shapira
  • Computer Science, Mathematics
  • Discret. Appl. Math.
  • 2020
TLDR
Although it is not always possible to construct the target file R by processing only the two input delta files, empirical experiments show that on typical real life data, usually about 99% of the file can be constructed using the proposed algorithm for the CSDE problem. Expand
In-place differential file compression of nonaligned files with applications to file distribution, backups, and string similarity
TLDR
This work presents a preprocessing step for string alignment that can be employed when the encoder determines significant gains will be achieved and compares well with other existing methods, including those that are not in-place. Expand
Bidirectional Delta Files
TLDR
A greedy algorithm is designed, which produces an efficient bidirectional delta file in terms of the memory storage it requires, and experiments show memory storage savings of at least $25\%$ between the implemented algorithm and the traditional way of using both forwards and backwards delta files. Expand
Modeling delta encoding of compressed files
TLDR
An optimal algorithm in terms of processing time for constructing the delta encoding when both files are compressed using LZW is presented, and whether successive ordered pairs refer to successive substrings and can thus be combined is checked. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 12 REFERENCES
A technique for isolating differences between files
TLDR
A simple algorithm is described for isolating the differences between two files by comparing two versions of a source program or other file. Expand
Bounds on the Complexity of the Longest Common Subsequence Problem
TLDR
It is shown that unless a bound on the total number of distinct symbols is assumed, every solution to the problem can consume an amount of time that is proportional to the product of the lengths of the two strings. Expand
The String-to-String Correction Problem
TLDR
An algorithm is presented which solves the string-to-string correction problem in time proportional to the product of the lengths of the two strings. Expand
WYLBUR: an interactive text editing and remote job entry system
TLDR
The external appearance of WYLBUR as well as its internal structure are described and a powerful method for addressing text by content is provided. Expand
An online editor
An online, interactive system for text editing is described in detail, with remarks on the theoretical and experimental justification for its form. Emphasis throughout the system is on providingExpand
The Art of Computer Programming
TLDR
The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid. Expand
A linear space algorithm for computing maximal common subsequences
The problem of finding a longest common subsequence of two strings has been solved in quadratic time and space. An algorithm is presented which will solve this problem in quadratic time and in linearExpand
The Art o f Computer Programming Sorting and Searching
  • The Art o f Computer Programming Sorting and Searching
  • 1973
The Art of Computer Programming, Vol. 3: Sorting and Searching
Digital Equipment Corp. DEC System 10 Assembly Language Handbook
  • Digital Equipment Corp. DEC System 10 Assembly Language Handbook
  • 1967
...
1
2
...