A Faster Algorithm Computing String Edit Distances

  title={A Faster Algorithm Computing String Edit Distances},
  author={William Joseph Masek and Mike Paterson},
  journal={J. Comput. Syst. Sci.},

Figures from this paper

Efficient Algorithms For Normalized Edit Distance
This work gives provably better algorithms for normalized edit distance computation with proven complexity bounds: an -time algorithm when the cost function is uniform, i.e, the weights of edit operations depend only on the type but not on the individual symbols involved, and an - time algorithms when the weights are rational.
The string edit distance matching problem with moves
This work relaxes the problem so that an additional operation is allowed, namely, substring moves, and approximate the string edit distance upto a factor of O(log n log*n), and results are obtained, which are the first known significantly subquadratic algorithm for a string editdistance problem in which the distance involves nontrivial alignments.
A Lower Bound for the Edit-Distance Problem Under an Arbitrary Cost Function
  • Xiaoqiu Huang
  • Computer Science, Mathematics
    Inf. Process. Lett.
  • 1988
An efficient uniform-cost normalized edit distance algorithm
  • Abdullah N. Arslan, Ö. Eğecioğlu
  • Computer Science
    6th International Symposium on String Processing and Information Retrieval. 5th International Workshop on Groupware (Cat. No.PR00268)
  • 1999
An O(mn log n)-time algorithm for the problem of normalized edit distance computation when the cost function is uniform, except substitutions can have different weights depending on whether they are matching or non-matching.
Streaming Algorithms For Computing Edit Distance Without Exploiting Suffix Trees
This paper presents two streaming algorithms for computing edit distance, one which runs in time $O(n+k^2)$ and the other which is known to be optimal under the Strong Exponential Time Hypothesis.
Efficient edit distance with duplications and
We propose three algorithms for string edit distance with duplications and contractions. These include an efficient general algorithm and two improvements which apply under certain constraints on the
Constrained string editing
Algorithms for String Editing which Permit Arbitrarily Complex Editing Constraints
  • B. Oommen
  • Computer Science, Mathematics
  • 1984
An algorithm has been presented to computed the minimum distance associated with editing X to Y subject to the specified constraint and the technique to compute the optimal -transformation has also been presented.


Bounds for the String Editing Problem
It is shown that if the operations on symbols of the strings are restricted to tests of equality, then O(nm) operations are necessary (and sufficient) to compute the distance between two strings.
The String-to-String Correction Problem
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.
An Extension of the String-to-String Correction Problem
The set of allowable edit operations is extended to include the operation of interchanging the positions of two adjacent characters under certain restrictions on edit-operation costs, and it is shown that the extended problem can still be solved in time proportional to the product of the lengths of the given strings.
Bounds on the Complexity of the Longest Common Subsequence Problem
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.
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 linear
The Design and Analysis of Computer Algorithms
This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
VALIANT, On time versus space and other related problems, in Proceedings
  • Annual Symposium on Foundations of Computer Science, Berkeley,
  • 1975
CHANDRA, Bounds for the string editing
  • problem, J. Assoc. Comput. Mach. 23,
  • 1976
FARADZEV, On economic construction of the transitive closure of a directed graph, Dokl
  • Akad, Nauk SSSR
  • 1970