|
537
|
The String-to-String Correction Problem
– R Wagner, M Fischer
- 1974
|
|
255
|
Simple fast algorithms for the editing distance between trees and related problems
– K Zhang, D Shasha
- 1989
|
|
51
|
A file comparison program
– Webb Miller, Eugene, W. Myers
- 1985
|
|
90
|
An algorithm for differential file comparison. Computer Science
– J W Hunt, M D McIlroy
- 1975
|
|
125
|
Change Detection in Hierarchically Structured Information
– Sudarshan S. Chawathe, Anand Rajaraman, Hector Garcia-molina, Jennifer Widom
- 1996
|
|
103
|
Meaningful Change Detection in Structured Data
– Sudarshan S. Chawathe , Hector Garcia-Molina
- 1997
|
|
144
|
A faster algorithm for computing string edit distances
– W J Masek, M S Paterson
- 1980
|
|
98
|
Fast parallel and serial approximate string matching
– G M Landau, U Vishkin
- 1989
|
|
27
|
G.: An O(NP) sequence comparison algorithm
– S Wu, U Manber, Myers
- 1990
|
|
40
|
Fast algorithms for the unit cost editing distance between trees
– D Shasha, K Zhang
- 1990
|
|
156
|
Algorithms for approximate string matching
– E Ukkonen
- 1985
|
|
67
|
On the Editing Distance between Undirected Acyclic Graphs
– Kaizhong Zhang, Jason Wang, Dennis Shasha, Communicated T. Jiang
- 1995
|
|
69
|
The string-to-string correction problem with block move
– W F Tichy
- 1984
|
|
325
|
Time warps, string edits, and macromolecules: the theory and practice of sequence comparison
– D Sankoff, J Kruskal
- 1983
|
|
50
|
Fast string matching with k differences
– G M Landau, U Vishkin
- 1988
|
|
161
|
On finding lowest common ancestors: simplification and parallelization
– B Schieber, U Vishkin
- 1988
|
|
285
|
Fast algorithms for finding nearest common ancestors
– D Harel, R E Tarjan
- 1984
|
|
75
|
An improved algorithm for approximate string matching
– Z Galil, K Park
- 1990
|
|
381
|
Linear pattern matching algorithms
– P Weiner
|
