|
119
|
A faster algorithm for computing string edit distances
– Masek, Paterson
- 1980
|
|
104
|
Algorithms for the longest common subsequence problem
– Hirschberg
- 1977
|
|
95
|
The string to string correction problem
– Wagner, Fischer
- 1974
|
|
51
|
Leiserson C and Rivest R, Introduction to Algorithms, (pp 776-800 for FFT, 837-844 for primality test, 812 for extended Euclid algorithm, 834-836 for RSA cryptosystem
– Cormen
- 1990
|
|
39
|
eds., Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison
– Sankoff, Kruskal
- 1983
|
|
36
|
The longest common subsequence problem revisited
– Apostolico, Guerra
- 1987
|
|
30
|
Sparse dynamic programming I: linear cost functions
– Eppstein, Galil, et al.
- 1992
|
|
27
|
Bounds for the String Editing Problem
– Wong, Chandra
- 1976
|
|
25
|
V.: Longest common subsequences
– Paterson, Dancik
- 1994
|
|
17
|
A longest common subsequence algorithm suitable for similar text strings
– Nakatsu, Kambayashi, et al.
- 1982
|
|
13
|
Fast linear-space computations of longest common subsequences
– Apostolico, Browne, et al.
- 1992
|
|
10
|
Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings
– Apostolico
- 1986
|
|
9
|
A fast algorithm for computing longest common subsequences of small alphabet size
– Chin, Poon
- 1990
|
|
7
|
A Linear Space Algorithm for Computing
– Hirschberg
- 1975
|
|
7
|
An information-theoretic lower bound for the longest common subsequence problem
– Hirschberg
- 1978
|
|
6
|
Algorithms for Approximate String
– Ukkonen
- 1985
|
|
5
|
Performance analysis of some simple heuristics for computing longest common subsequences. Algorithmica 12
– Chin, K
- 1994
|
|
3
|
A Fast Algorithm for Computing
– Hunt, Szymanski
- 1977
|
|
1
|
Du: New Algorithms for the LCS
– Hsu, W
- 1984
|
|
1
|
Rangan: A Linear Space Algorithm for the LCS
– Kumar, P
- 1987
|
|
1
|
Myers: An O(ND) Difference Algorithm and Its Variations, Algorithmica
– W
- 1986
|
