A Technique for Isolating Differences Between Files

Communications of the ACM

Volumn 21, Issue 4, 1978, Pages 264-268

  Heckel, Paul ^a  

^a Interactive Systems Consultants ^*  (United States)

Author keywords

bandwidth compression; difference isolation; file comparison; file compression; hashcoding; longest common subsequence; molecular evolution; program maintenance; text editing; word processing

Indexed keywords

COMPUTER PROGRAMMING;

EID: 0017959098     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/359460.359467     Document Type: Article

References (28)

1. Adel'son-Vel'skii, G.M., and Landis, Y.M. An algorithm for the organisation of information. Dokl. Akad. Nauk. SSSR 146, (1962), 263-266.
2. Aho, A.V., Hopcroft, J.E., and Ullman, J.D. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.
3. Brown, M.R. Implementation and analysis of binomial queue algorithms. (to appear in SICOMP).
4. Cheriton, D., Tarjan, R.E., Yao, A.C. Finding minimum spanning trees. Res. Rep. Dept. Comptr. Sci. Stanford U., Stanford, Calif., 1975.
5. SIAM J. Comptng. 5, 4 (Dec. 1976), 724-742.
6. Crane, C.A. Linear lists and priority queues as balanced binary trees. Rep. Stan-CS-72-259, Dept. Comptr. Sci., Stanford U., Stanford, Calif., 1972.
7. Fischer, M.J. Efficiency of equivalence algorithms. In Complexity of Computer Computations, R.E. Miller and J.W. Thatcher, Eds., Plenum Press, New York, 1972, pp. 158-168.
8. Floyd, R.W. Algorithm 245. Treesort 3. Comm. ACM 7, 12 (Dec. 1964), 701.
9. Ford, L.R., and Johnson, S.M. A tournament problem. Amer. Math. Monthly 66 (1959), 387-389.
10. Françon, J. Représentation d'une file de priorités par un arbre binaire. Rapport, Dept. Math., U. de Strasbourg, 1975.
11. Gentleman, W.M. Row elimination for solving sparse linear systems and least squares problems. Dundee Biennial Conf. on Numer. Anal., 1975.
12. Gonnet, G.H. Heaps applied to event driven mechanisms. Comm. ACM 19, 7 (July 1976), 417-418.
13. Gonnet, G.H., and Rogers, L.D. An algorithmic and complexity analysis of the heap as a data structure. Res. Rep. CS 75-20, U. of Waterloo, Waterloo, Canada, 1975.
14. Johnson, D.B. Algorithms for shortest paths. Ph.D. Th., Cornell U., Ithaca, N.Y., 1973.
15. Johnson, D.B. Priority queues with update and finding minimum spanning trees. Tech. Rep. 170, Penn. State U., University Park, Pa., 1975.
16. Jonassen, A., and Dahl, O.J. Analysis of an algorithm for priority queue administration. BIT 15 (1975), 409-422.
17. Knuth, D.E. The Art of Computer Programming, Vol. 1: Fundamental Algorithms. Addison-Wesley, Reading, Mass., 1968.
18. Knuth, D.E. The Art of Computer Programming, Vol. 3: Sorting and Searching. Addison-Wesley, Reading, Mass., 1973.
19. Knuth, D.E. Selected Topics in Computer Science. Lecture Notes Series, Inst. Math. U. of Oslo, 1973.
20. Malcolm, M.A., and Simpson, R.B. Local versus Global Strategies for Adaptative Quadrature. ACM Trans. Math. Software, 1, 2 (June 1975), 129-146.
21. Paterson, M., Pippenger, N., Schönhage, A. Finding the median. Theory Comp. Rep. no. 6, U. of Warwick, Coventry, England, 1975.
22. Porter, T., and Simon, I. Random insertion into a priority queue structure. Rep. Stan-Cs-74-460, Dept. Comptr. Sci., Stanford U., Stanford, Calif., 1974.
23. Prim, R. C. Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36, 6 (1957), 1389-1401.
24. van Emde Boas, B.P., Kaas, R., and Zijlstra, E. Design and implementation of an efficient priority queue. Math. Centrum Rep. ZW 60/75, Amsterdam, 1975.
25. Vaucher, J.G., and Duval, P. A comparison of simulation event list algorithms. Comm. ACM 18, 4 (April 1975), 223-230.
26. Vuillemin, J. Structures de données. Notes de cours de l'ecole d'été, CEA-EDF-IRIA, 1975.
27. Williams, J.W.J. Algorithm 232. Heapsort. Comm. ACM 7, 6 (June 1964), 347-348.
28. Wyman, F.P. Improved Event–Scanning Mechanisms for Discrete Event Simulation. Comm. ACM 18, 6 (June 1975), 350-353.