An application of file-comparison algorithms to the study of program editors

This publication has 11 references indexed in Scilit:

• On improving the worst case running time of the Boyer-Moore string matching algorithm
  Communications of the ACM, 1979
• A Family of Similarity Measures Between Two Strings
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1979
• A procedure for predicting program editor performance from the user's point of view
  International Journal of Man-Machine Studies, 1978
• A technique for isolating differences between files
  Communications of the ACM, 1978
• A fast string searching algorithm
  Communications of the ACM, 1977
• Fast Pattern Matching in Strings
  SIAM Journal on Computing, 1977
• A fast algorithm for computing longest common subsequences
  Communications of the ACM, 1977
• Efficient string matching
  Communications of the ACM, 1975
• A linear space algorithm for computing maximal common subsequences
  Communications of the ACM, 1975
• A step toward automatic analysis of student programming errors in a batch environment
  International Journal of Man-Machine Studies, 1974