A new distance metric on strings computable in linear time

Discrete Applied Mathematics

Volumn 20, Issue 3, 1988, Pages 191-203

  Ehrenfeucht, A ^a   Haussler, D ^b  

^a UNIVERSITY OF COLORADO   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

clustering; distance metric; editing; partial match; Sequence comparison; spelling correction; string matching; text processing

Indexed keywords

DATA PROCESSING;

DISTANCE METRIC; FILE MANAGING; STRING MATCHING; TEXT EDITING;

MATHEMATICAL TECHNIQUES;

EID: 0024050355     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(88)90076-5     Document Type: Article

References (9)

1. The smallest automaton recognizing the subwords of a text
2. Sequence landscapes
3. A technique for isolating differences between files
4. A faster algorithm for computing string-edit distances
5. A space-economical suffix tree construction algorithm
6. Identification of common molecular subsequences
7. The string-to-string correction problem with block moves