J. W. Hunt, M. D. McIlroy, An algorithm for differential file comparison, Technical Report #41, Computing Science, Bell Laboratories, 1976 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Parameterized Parallel Algorithm for Efficient Biological.. - Alves, Caceres (Correct)
....No. 52.3778 96 1 and 46.1230 00 3, and CNPq NSF Proc. No. 68.0037 99 3. particular, sequence comparison is a fundamental problem that appears in more complex problems [13] such as the search of similarities between biosequences [11, 12, 14] as well as in the solution of several other problems [10, 9, 16]. One way to identify similarities between sequences is to align them, with the insertion of spaces in the two sequences, in such way that the two sequences became of the same size. In the similarity approach, we are interested in the best alignment between two strings, and the score of such an ....
J. Hunt and T. Szymansky. An algorithm for differential file comparison. Comm. ACM, (20):350--353, 1977.
Supporting Autonomous Work and Reintegration in.. - Berger, Schill, Volksen (1998) (1 citation) (Correct)
....developed (see [8] but are not considered in detail in this paper. Existing approaches can be subdivided into reintegration tools for database systems (Data Patch [10] Optimistic Protocol [9] and Log Transformation [11] operating and file systems (Version Vectors [12] Fcomp [13] Unix Diff [14], Application Specific Resolver [15] Conflict Resolvers [16] Disconnected Operation for AFS [17] and Coda [18] File Merge [19] and collaborative systems. Within collaborative systems three specific application domains may be distinguished: text editing systems (Flexible Diff [20] Object ....
Hunt, J. W., McIlroy, M. D.: An Algorithm for Differential File Comparison. Computing Science Technical Report No. 41, Bell Labs, N.J., June 1976.
Sequence Comparison: Some Theory and Some Practice - Simon (1988) (3 citations) (Correct)
.... A very important subproblem is obtained by restricting the input to permutations (sequences in which each letter occurs at most once) This case was solved by Szymansky [42] in time O(n log n) Such an algorithm is also contained in work of Hunt and Szymanski [25] and that of Hunt and McIlroy [24]. It is an open problem whether or not the case of permutations can be done in linear time on the model we proposed. A further restriction leads to yet another very important subproblem. This is obtained if we consider (1; 2; n) as one of the permutations, assuming, of course, the alphabet ....
....thoroughly influenced by the intricacies of machine transformation of one file in another and this restricts, in our opinion, its potential as a tool for remembering or discovering the changes during the evolution of a file. The algorithm actually used by diff is described by Hunt and McIlroy in [24]; its basic idea is attributed to unpublished work of H. S. Stone who generalized an O(n log n) solution of the most important particular case (the restriction of the problem to permutations) by T. G. Szymanski [42] The resulting algorithm is very similar to the one in [25] it is also described ....
J. W. Hunt and M. D. McIlroy. An algorithm for differential file comparison. Technical Report #41, Computing Science, Bell Laboratories, 1976.
Visualizing Corporate Data - Eick, Fyock (1996) (4 citations) (Correct)
....independently on a joint paper must periodically merge their respective versions together. A maintenance programmer fixing a recently introduced bug may want to compare the newer modified version of a program with its older working predecessors to help locate a problem. On Unix systems, diff [HM75], the standard tool for comparing files, is one of the most frequently executed commands. Diff is used for comparing source code and other ASCII files, as well as the engine used by many other system commands. Although there has been extensive algorithmic work for efficiently calculating program ....
J. W. Hunt and M. D. McIlroy. An algorithm for differential file comparison. Computer Sciences Report 41, AT&T Bell Laboratories, Murray Hill, New Jersey, 1975.
Practical Language-Independent Detection of Near-Miss - Clones James Cordy (Correct)
No context found.
J. W. Hunt, M. D. McIlroy, An algorithm for differential file comparison, Technical Report #41, Computing Science, Bell Laboratories, 1976
An O(ND) Difference Algorithm and Its Variations - Myers (1986) (12 citations) (Correct)
No context found.
Hunt, J.W. and McIlroy, M.D. "An Algorithm for Differential File Comparison." Computing Science Technical Report 41, Bell Laboratories (1975). - 14 -
A Language-Independent Approach to Detection of Near-Miss Clones - Synytskyy, al. (2004) (Correct)
No context found.
J. W. Hunt, M. D. McIlroy, "An algorithm for differential file comparison", Technical Report #41, Computing Science, Bell Laboratories, 1976
RCS - A System for Version Control - Tichy (1985) (127 citations) (Correct)
No context found.
Hunt, James W. and McIlroy, M. D., "An Algorithm for Differential File Comparison," 41, Computing Science Technical Report, Bell Laboratories, June 1976.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC