论文信息 - A new distance metric on strings computable in linear time

A new distance metric on strings computable in linear time

Abstract We describe a new metric for sequence comparison that emphasizes global similarity over sequential matching at the local level. It has the advantage over the Levenshtein metric that strings of lengths n and m can be compared in time proportional to n + m instead of nm . Various mathematical properties of the metric are established.

David Haussler | Andrzej Ehrenfeucht | D. Haussler | A. Ehrenfeucht

[1] M S Waterman,et al. Identification of common molecular subsequences. , 1981, Journal of molecular biology.

[2] Mike Paterson,et al. A Faster Algorithm Computing String Edit Distances , 1980, J. Comput. Syst. Sci..

[3] Paul Heckel,et al. A technique for isolating differences between files , 1978, CACM.

[4] Edward M. McCreight,et al. A Space-Economical Suffix Tree Construction Algorithm , 1976, JACM.

[5] Michael David Bacon. Data transmission , 1973 .

[6] David Haussler,et al. The Smallest Automaton Recognizing the Subwords of a Text , 1985, Theor. Comput. Sci..

[7] Walter F. Tichy,et al. The string-to-string correction problem with block moves , 1984, TOCS.