论文信息 - An LCS-based string metric

An LCS-based string metric

These notes presents a string similarity measure which is a metric in the mathematical sense. In particular, the triangle inequality holds for this metric. The metric is based on the longest common subsequence (LCS) measure, and the complexity of any sensible implementation will be no worse than O(n).

Daniel Bakkelund

[1] Enrique Vidal,et al. Computation of Normalized Edit Distance and Applications , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[2] G. A. Watson. An Algorithm for the Single Facility Location Problem Using the Jaccard Metric , 1983 .

[3] Ronald I. Greenberg. Bounds on the Number of Longest Common Subsequences , 2003, ArXiv.

[4] Ralph P. Grimaldi,et al. Discrete and Combinatorial Mathematics: An Applied Introduction , 1998 .

[5] V. G. Timkovskii. Complexity of common subsequence and supersequence problems and related problems , 1989 .

[6] S. B. Needleman,et al. A general method applicable to the search for similarities in the amino acid sequence of two proteins. , 1970, Journal of molecular biology.

[7] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8] David Manlove,et al. Combined super-/substring and super-/subsequence problems , 2004, Theor. Comput. Sci..

[9] Abraham Kandel,et al. Data Mining in Time Series Database , 2004 .

[10] C. Chevalley. Fundamental concepts of algebra , 1959 .

[11] Michael J. Fischer,et al. The String-to-String Correction Problem , 1974, JACM.

[12] Tok Wang Ling,et al. A New Efficient Data Cleansing Method , 2002, DEXA.